Pages that link to "Item:Q3434543"
From MaRDI portal
The following pages link to Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms (Q3434543):
Displayed 6 items.
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability (Q722517) (← links)
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410) (← links)
- A Moderately Exponential Time Algorithm for k-IBDD Satisfiability (Q3449853) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- Experimental Study of the Shortest Reset Word of Random Automata (Q5200075) (← links)