The following pages link to STACS 2004 (Q5309695):
Displayed 8 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)
- An improved upper bound for SAT (Q820534) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- An algorithm for exact satisfiability analysed with the number of clauses as parameter (Q1045885) (← links)
- A Moderately Exponential Time Algorithm for k-IBDD Satisfiability (Q3449853) (← links)
- On Some Aspects of Mixed Horn Formulas (Q3637161) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)