![](/img/cover-not-exists.png)
[IEEE 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2008.10.25-2008.10.28)] 2008 49th Annual IEEE Symposium on Foundations of Computer Science - Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
Guruswami, Venkatesan, Manokaran, Rajsekar, Raghavendra, PrasadYear:
2008
Language:
english
DOI:
10.1109/focs.2008.51
File:
PDF, 346 KB
english, 2008