default search action
"Cyclic Ordering is NP-Complete."
Zvi Galil, Nimrod Megiddo (1977)
- Zvi Galil, Nimrod Megiddo:
Cyclic Ordering is NP-Complete. Theor. Comput. Sci. 5(2): 179-182 (1977)
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.