Pages that link to "Item:Q1853552"
From MaRDI portal
The following pages link to A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552):
Displaying 44 items.
- Derandomizing the HSSW algorithm for 3-SAT (Q378221) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- A randomized algorithm for 3-SAT (Q626900) (← links)
- An improved deterministic local search algorithm for 3-SAT (Q706635) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- Density condensation of Boolean formulas (Q860385) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Modelling the dynamics of stochastic local search on \(k\)-SAT (Q930153) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← 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)
- Local reduction (Q1641001) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) (← links)
- Improved agreeing-gluing algorithm (Q2254079) (← links)
- Sequential vector packing (Q2378514) (← links)
- Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410) (← links)
- On converting CNF to DNF (Q2576880) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Exploiting partial knowledge of satisfying assignments (Q2643304) (← links)
- Using small-scale quantum devices to solve algebraic equations (Q2690295) (← links)
- Satisfiability Certificates Verifiable in Subexponential Time (Q3007671) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- An improved local search algorithm for 3-SAT (Q3439130) (← links)
- Local Reductions (Q3448833) (← links)
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (Q3637160) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- Exact Algorithms for MAX-SAT (Q4916231) (← links)
- Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT (Q5002768) (← links)
- A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles (Q5218804) (← links)
- Guided Search and a Faster Deterministic Algorithm for 3-SAT (Q5458517) (← links)
- Solving NP-Complete Problems with Quantum Search (Q5458579) (← links)
