Number of the records: 1
One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete
- 1.0402598 - UIVT-O 981037 US eng J - Journal Article
Kratochvíl, J. - Savický, Petr - Tuza, Z.
One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete.
Siam Journal on Computing. Roč. 22, č. 1 (1993), s. 203-210. ISSN 0097-5397. E-ISSN 1095-7111
Keywords : satisfiability * Boolean formula * conjuctive normal form * NP-completeness
Permanent Link: http://hdl.handle.net/11104/0122996
Number of the records: 1