Pages that link to "Item:Q3694704"
From MaRDI portal
The following pages link to The Pure Literal Rule and Polynomial Average Time (Q3694704):
Displayed 14 items.
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem (Q918700) (← links)
- Polynomial-average-time satisfiability problems (Q1095678) (← links)
- An exponential lower bound for the pure literal rule (Q1104093) (← 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)
- On the occurence of null clauses in random instances of Satisfiability (Q1208481) (← links)
- Resolving contradictions: A plausible semantics for inconsistent systems (Q1332637) (← links)
- Easy problems are sometimes hard (Q1342226) (← links)
- Exact satisfiability, a natural extension of set partition, and its average case behavior (Q1353993) (← links)
- An average case analysis of a resolution principle algorithm in mechanical theorem proving. (Q1353997) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- Approximate reasoning with credible subsets (Q4371295) (← links)
- Explaining by evidence (Q4779486) (← links)