default search action
"Knuth-Bendix constraint solving is NP-complete."
Konstantin Korovin, Andrei Voronkov (2005)
- Konstantin Korovin, Andrei Voronkov:
Knuth-Bendix constraint solving is NP-complete. ACM Trans. Comput. Log. 6(2): 361-388 (2005)
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.