ALEXANDER
B. WOLPERT, Ph.D.
Recent Publications
(starting 2003) Evgeny
Dantsin and Alexander Wolpert.
Exponential Complexity of
Satisfiability Testing for LinearSize Boolean Formulas,
in Proceedings
of the 8th International Conference on Algorithms and Complexity, CIAC 2013, volume
7878 of Lecture Notes in Computer Science, pages 110121. Springer,
2013. [pdf] Evgeny
Dantsin and Alexander Wolpert.
On moderately exponential time for SAT. In Proceedings
of the 13th International Conference on Theory and Applications of
Satisfiability Testing, SAT 2010,
volume 6175 of Lecture
Notes in Computer Science, pages 313325.
Springer, 2010. [pdf] E. Dantsin and A. Wolpert. MAXSAT
for formulas with constant clause density can be solved faster than in O(2^{n}) time. In Proceedings of
the 9th International Conference on Theory and Applications of Satisfiability
Testing, SAT 2006, volume 4121 of Lecture Notes in Computer Science,
pages 266276. Springer, 2006. [pdf] M. Ceberio, E. Dantsin, V. Kreinovich, A. Wolpert, and G. Xiang. Detecting outliers under
interval uncertainty: A new algorithm based on constraint satisfaction. In Proceedings
of the 11th International Conference on Information Processing and Management
of Uncertainty in KnowledgeBased Systems, IPMU 2006, pages 802809,
2006. [pdf] E. Dantsin, E.A. Hirsch, A. Wolpert. Clause Shortening
Combined with Pruning Yields a New Upper Bound for Deterministic SAT
Algorithms. In Proceedings
of the 6th International Conference on Algorithms and Complexity, CIAC 2006,
volume 3998 of Lecture Notes in Computer Science, pages 6068. Springer, 2006. Also ECCC, TR05102, September 2005. [pdf] E. Dantsin, V. Kreinovich, A. Wolpert. Quantum Versions of kCSP Algorithms: a
First Step Towards Quantum Algorithms for IntervalRelated Constraint
Satisfaction Problems. In Proceedings of the ACM Symposium on Applied
Computing, SAC 2006, pages 16241628, 2006. [pdf] E. Dantsin, V. Kreinovich, A. Wolpert, and G. Xiang. Population variance under
interval uncertainty: A new algorithm. In Reliable Computing, 12(4),
pages 273280, 2006. [pdf] E. Dantsin, V. Kreinovich, A. Wolpert. On Quantum Versions of RecordBreaking
Algorithms for SAT. In SIGACT News, 36(4), pages 103108, December
2005. [pdf] E. Dantsin, A. Wolpert. A Faster
ClauseShortening Algorithm for SAT with No Restriction on Clause Length. In Journal
on Satisfiability, Boolean Modeling and Computation, 1 (1), pages 4960,
August  December 2005. This paper is an extended version of the paper
presented at SAT 2005 and published in LNCS 3569. [pdf] E. Dantsin
and A. Wolpert. An improved upper
bound for SAT. In Proceedings
of the 8th International Conference on Theory and Applications of
Satisfiability Testing, SAT 2005, volume 3569 of Lecture Notes in Computer Science, pages
400407. Springer, 2005.
