Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1775445

From MaRDI portal
Publication:4542577
Jump to:navigation, search

zbMATH Open1028.68068MaRDI QIDQ4542577FDOQ4542577


Authors: Michael Freedman Edit this on Wikidata


Publication date: 1 August 2002



Title of this publication is not available (Why is that?)



Recommendations

  • The complexity of satisfiability problems
  • A simplified NP-complete satisfiability problem
  • On the complexity of \(k\)-SAT
  • scientific article; zbMATH DE number 152108
  • NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k ,r-UNLSAT ≥ k )


zbMATH Keywords

general Boolean formula


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)



Cited In (3)

  • Boolean formulae, hypergraphs and combinatorial topology
  • Determining the <I>SHOIN(D)</I>-Satisfiability with a Complete Disjunctive Normal Form Group
  • Periodic constraint satisfaction problems: Tractable subclasses





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542577)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4542577&oldid=18662233"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 10:17. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki