Pages that link to "Item:Q3335000"
From MaRDI portal
The following pages link to Solving Satisfiability with Less Searching (Q3335000):
Displaying 13 items.
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- A logical framework for depiction and image interpretation (Q582146) (← links)
- Polynomial-average-time satisfiability problems (Q1095678) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- Ordered model trees: A normal form for disjunctive deductive databases (Q1344891) (← links)
- Solving propositional satisfiability problems (Q1356218) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- On a generalization of extended resolution (Q1961452) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (Q3637160) (← links)
- An artificial neural network satisfiability tester (Q4329689) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
