Pages that link to "Item:Q3829072"
From MaRDI portal
The following pages link to CNF-Satisfiability Test by Counting and Polynomial Average Time (Q3829072):
Displaying 18 items.
- Two approximate algorithms for model counting (Q507433) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- A dual algorithm for the satisfiability problem (Q750165) (← links)
- Inclusion-exclusion for \(k\)-CNF formulas (Q1014406) (← links)
- A rigorous methodology for specification and verification of business processes (Q1037243) (← links)
- Solving the satisfiability problem by using randomized approach (Q1190510) (← links)
- Resolving contradictions: A plausible semantics for inconsistent systems (Q1332637) (← links)
- An average case analysis of a resolution principle algorithm in mechanical theorem proving. (Q1353997) (← links)
- On the structure of some classes of minimal unsatisfiable formulas (Q1408380) (← links)
- Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (Q1417580) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Counting for satisfiability by inverting resolution (Q2386352) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- (Q2741513) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products (Q3438996) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)
