The following pages link to Alexander Wolpert (Q1791021):
Displayed 13 items.
- Reconstruction of Boolean formulas in conjunctive normal form (Q1791022) (← links)
- Population variance under interval uncertainty: a new algorithm (Q2503169) (← links)
- (Q3429016) (← links)
- Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms (Q3434543) (← links)
- (Q4808635) (← links)
- Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas (Q4924642) (← links)
- On Moderately Exponential Time for SAT (Q4930599) (← links)
- STACS 2004 (Q5309695) (← links)
- A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE (Q5696946) (← links)
- Theory and Applications of Satisfiability Testing (Q5713730) (← links)
- Theory and Applications of Satisfiability Testing (Q5714775) (← links)
- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time (Q5756576) (← links)
- An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF (Q6113549) (← links)
