Pages that link to "Item:Q1082830"
From MaRDI portal
The following pages link to Solving satisfiability in less than \(2^ n\) steps (Q1082830):
Displaying 50 items.
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- Derandomizing the HSSW algorithm for 3-SAT (Q378221) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- A randomized algorithm for 3-SAT (Q626900) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- Number of models and satisfiability of sets of clauses (Q672138) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- Counting minimal unsatisfiable subsets (Q832272) (← links)
- Density condensation of Boolean formulas (Q860385) (← links)
- Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
- Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas (Q946041) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Polynomial-average-time satisfiability problems (Q1095678) (← links)
- An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences (Q1097717) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses (Q1275602) (← links)
- A lower bound for tree resolution (Q1336637) (← links)
- An average case analysis of a resolution principle algorithm in mechanical theorem proving. (Q1353997) (← links)
- Solving propositional satisfiability problems (Q1356218) (← links)
- A fast parallel SAT-solver -- efficient workload balancing (Q1380435) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- Autark assignments of Horn CNFs (Q1742887) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A mathematic-physical approach to the satisfiability problem (Q1805394) (← links)
- On the r,s-SAT satisfiability problem and a conjecture of Tovey (Q1822964) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- Faster exact solutions for some NP-hard problems. (Q1853491) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- A short note on some tractable cases of the satisfiability problem. (Q1854345) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- A general method for deciding about logically constrained issues (Q1926579) (← links)
- A combinatorial analysis for the critical clause tree (Q1946495) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479) (Q1961443) (← links)
- On a generalization of extended resolution (Q1961452) (← links)
- Complexity analysis of propositional resolution with autarky pruning (Q1961454) (← links)
- On \(k\)-positive satisfiability problem (Q1964360) (← links)
