Easy problems are sometimes hard
- 31 October 1994
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 70 (1-2) , 335-345
- https://doi.org/10.1016/0004-3702(94)90109-0
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The hardest constraint problems: A double phase transitionArtificial Intelligence, 1994
- The Pure Literal Rule and Polynomial Average TimeSIAM Journal on Computing, 1985
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960