Pages that link to "Item:Q1960406"
From MaRDI portal
The following pages link to New methods for 3-SAT decision and worst-case analysis (Q1960406):
Displaying 43 items.
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- Quantifier elimination by dependency sequents (Q479823) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- A randomized algorithm for 3-SAT (Q626900) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- The complexity of pure literal elimination (Q862401) (← links)
- On the number of minimal transversals in 3-uniform hypergraphs (Q932689) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- On the number of 2-packings in a connected graph (Q1761463) (← links)
- Counting models for 2SAT and 3SAT formulae (Q1770390) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- On a generalization of extended resolution (Q1961452) (← links)
- Complexity analysis of propositional resolution with autarky pruning (Q1961454) (← links)
- On the complexity of unique circuit SAT (Q2202678) (← links)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- New upper bound for the \#3-SAT problem (Q2380029) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Efficient 3-SAT algorithms in the tile assembly model (Q2629931) (← links)
- Exploiting partial knowledge of satisfying assignments (Q2643304) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Improving Efficiency of 3-SAT-Solving Tile Systems (Q3070958) (← links)
- Counting Independent Sets in Claw-Free Graphs (Q3104779) (← links)
- New upper bounds for the problem of maximal satisfiability (Q3225865) (← links)
- The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
- (Q4989407) (← links)
- Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT (Q5002768) (← links)
- (Q5150602) (← links)
- Solving NP-Complete Problems with Quantum Search (Q5458579) (← links)
- CASCADING RANDOM WALKS (Q5462126) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
- Partial quantifier elimination and property generation (Q6535530) (← links)
- A bisection approach to subcubic maximum induced matching (Q6575400) (← links)
