Travelled to:1 × France
1 × USA
2 × Canada
2 × United Kingdom
Collaborated with:E.Dantsin V.Kreinovich
Talks about:sat (5) algorithm (4) derandom (2) schuler (2) quantum (2) time (2) constraint (1) satisfact (1) exponenti (1) constant (1)
Person: Alexander Wolpert
DBLP: Wolpert:Alexander
Contributed to:
2010
20062006200520042005Wrote 6 papers:
- SAT-2010-DantsinW #exponential #on the #satisfiability
- On Moderately Exponential Time for SAT (ED, AW), pp. 313–325.
- SAC-2006-DantsinWK #algorithm #constraints #problem #quantum #towards
- Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems (ED, AW, VK), pp. 1640–1644.
- SAT-2006-DantsinW #constant #performance #satisfiability
- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time (ED, AW), pp. 266–276.
- SAT-2005-DantsinW #bound #satisfiability
- An Improved Upper Bound for SAT (ED, AW), pp. 400–407.
- SAT-2004-DantsinW #algorithm #satisfiability
- Derandomization of Schuler’s Algorithm for SAT (ED, AW), pp. 69–75.
- SAT-J-2004-DantsinW05 #algorithm #satisfiability
- Derandomization of Schuler’s Algorithm for SAT (ED, AW), pp. 80–88.