


default search action
"Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic ..."
Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra (2008)
- Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra:
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. FOCS 2008: 573-582

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.