The k-satisfiability problem remains np-complete for dense families

Schiermeyer, Ingo

Amsterdam : North-Holland Publ. Co. [u.a.] (1994)
Contribution to a conference proceedings, Journal Article

In: Discrete mathematics
Volume: 125
Issue: 1/3
Page(s)/Article-Nr.: 343-346

Institutions

• Department of Mathematics [110000]
• Chair of Mathematics of Information Processing [114510]