default search action
"Knuth-Bendix Constraint Solving Is NP-Complete."
Konstantin Korovin, Andrei Voronkov (2001)
- Konstantin Korovin, Andrei Voronkov:
Knuth-Bendix Constraint Solving Is NP-Complete. ICALP 2001: 979-992
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.