Pages that link to "Item:Q1082830"
From MaRDI portal
The following pages link to Solving satisfiability in less than \(2^ n\) steps (Q1082830):
Displayed 23 items.
- (Q2741521) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Improving Efficiency of 3-SAT-Solving Tile Systems (Q3070958) (← links)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)
- Truth Assignments as Conditional Autarkies (Q3297584) (← links)
- О весах булевых функций, представимых в виде $2$-КНФ или $3$-КНФ (Q3382008) (← links)
- Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
- A Decision-Making Procedure for Resolution-Based SAT-Solvers (Q3502699) (← links)
- A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
- An artificial neural network satisfiability tester (Q4329689) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q4572009) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q4837676) (← links)
- Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT (Q5002768) (← links)
- Local search algorithms for SAT: Worst-case analysis (Q5054860) (← links)
- Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870) (← links)
- A CNF Formula Hierarchy over the Hypercube (Q5385533) (← links)
- Guided Search and a Faster Deterministic Algorithm for 3-SAT (Q5458517) (← links)
- CASCADING RANDOM WALKS (Q5462126) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
- (Q5743451) (← links)
- On the complexity of \(k\)-SAT (Q5943094) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
- An approximation algorithm for 3-Colourability (Q6122218) (← links)