One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete
Work
Year: 1993
Type: article
Source: SIAM Journal on Computing
Authors Jan Kratochvı́l, Petr Savický, Zsolt Tuza
Institutions Charles University, Hungarian Academy of Sciences
Cites: 6
Cited by: 79
Related to: 10
FWCI: 1.427
Citation percentile (by year/subfield): 93.81
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed