A simple NP-hard problem

Authors:
R. Demontis
Affiliations:
University of Torino
Venue:
ACM SIGACT News
Year:
2009

Citing 3
Cited 0

Elements of the Theory of Computation

Elements of the Theory of Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.01

Visualization

Abstract