On k-positive satisfiability problem
From MaRDI portal
DOI10.1007/BF02948732zbMATH Open1084.68889OpenAlexW2038049006MaRDI QIDQ1964360FDOQ1964360
Authors: Xiong Huang, Wei Li 
Publication date: 1999
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02948732
Recommendations
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- The complexity of theorem-proving procedures
- On the Complexity of Timetable and Multicommodity Flow Problems
- Solving satisfiability in less than \(2^ n\) steps
- Title not available (Why is that?)
- Unit Refutations and Horn Sets
- A linear algorithm for renaming a set of clauses as a Horn set
- A hierarchy of tractable satisfiability problems
- Number of models and satisfiability of sets of clauses
Cited In (9)
- A hierarchy of tractable satisfiability problems
- On the K‐sat model with large number of clauses
- A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability
- Solving satisfiability in less than \(2^ n\) steps
- Title not available (Why is that?)
- An algorithm based on tabu search for satisfiability problem
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF
This page was built for publication: On \(k\)-positive satisfiability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964360)
