Pages that link to "Item:Q4651809"
From MaRDI portal
The following pages link to An algorithm for the satisfiability problem of formulas in conjunctive normal form (Q4651809):
Displayed 21 items.
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Analysis of local search landscapes for \(k\)-SAT instances (Q626907) (← links)
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability (Q722517) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- Satisfiability Certificates Verifiable in Subexponential Time (Q3007671) (← links)
- On the Exact Complexity of Evaluating Quantified k-CNF (Q3058691) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- A Moderately Exponential Time Algorithm for k-IBDD Satisfiability (Q3449853) (← links)
- Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207) (← links)
- The Complexity of Satisfiability of Small Depth Circuits (Q3656852) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- (Q5743451) (← links)