Pages that link to "Item:Q787685"

The following pages link to Average time analyses of simplified Davis-Putnam procedures (Q787685):

Displaying 23 items.

• Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem (Q918700) (← links)
• Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
• Solving satisfiability in less than \(2^ n\) steps (Q1082830) (← links)
• Polynomial-average-time satisfiability problems (Q1095678) (← links)
• On the IO-complexity and approximation languages (Q1112018) (← links)
• Average complexity of divide-and-conquer algorithms (Q1114395) (← links)
• Probabilistic performance of a heurisic for the satisfiability problem (Q1115189) (← links)
• Solving the satisfiability problem by using randomized approach (Q1190510) (← links)
• Counting propositional models (Q1197995) (← links)
• Resolving contradictions: A plausible semantics for inconsistent systems (Q1332637) (← links)
• A lower bound for tree resolution (Q1336637) (← links)
• Exact satisfiability, a natural extension of set partition, and its average case behavior (Q1353993) (← links)
• The expected complexity of analytic tableaux analyses in propositional calculus. II (Q1353995) (← links)
• An average case analysis of a resolution principle algorithm in mechanical theorem proving. (Q1353997) (← links)
• A statistical approach to adaptive problem solving (Q1391900) (← links)
• The \(Multi\)-SAT algorithm (Q1961449) (← links)
• Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
• A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence (Q3191203) (← links)
• The large deviations of the whitening process in random constraint satisfaction problems (Q3302666) (← links)
• Approximate reasoning with credible subsets (Q4371295) (← links)
• Explaining by evidence (Q4779486) (← links)
• A threshold for unsatisfiability (Q5096838) (← links)
• Results related to threshold phenomena research in satisfiability: Lower bounds (Q5958805) (← links)