On the parameterized complexity of diverse SAT
From MaRDI portal
Cites work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
- A perspective on certain polynomial-time solvable classes of satisfiability
- Algorithms and Computation
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- CNF-Satisfiability Test by Counting and Polynomial Average Time
- Disjoint stable matchings in linear time
- Diverse Pairs of Matchings
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
- Face covers and the genus problem for apex graphs
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Finding diverse minimum s-t cuts
- Fundamentals of parameterized complexity
- How ordinary elimination became Gaussian elimination
- scientific article; zbMATH DE number 3489106 (Why is no real title available?)
- scientific article; zbMATH DE number 7650314 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Measure and Conquer for Max Hamming Distance XSAT
- New width parameters for SAT and \#SAT
- On the complexity of k-SAT
- Parameterized algorithms
- Polynomial-time inference of all valid implications for Horn and related formulae
- Recent Advances in Constraints
- Recognition of q-Horn formulae in linear time
- Reducibility among combinatorial problems (1972)
- Renaming a Set of Clauses as a Horn Set
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
- The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
This page was built for publication: On the parameterized complexity of diverse SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6881965)
