Alexander Wolpert - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2023

An Isomorphism-Invariant Distance Function on Propositional Formulas in CNFEvgeny Dantsin, Alexander Wolpert. jsat, 14(1):1-15, 2023. [doi]

An AlphaZero-Inspired Approach to Solving Search ProblemsEvgeny Dantsin, Vladik Kreinovich, Alexander Wolpert. In Martine Ceberio, Vladik Kreinovich, editors, Decision Making Under Uncertainty and Constraints - A Why-Book. Volume 217 of pages 129-138, Springer, 2023. [doi]

2020

Similarity Between Points in Metric Measure SpacesEvgeny Dantsin, Alexander Wolpert. sisap 2020: 177-184 [doi]

Anchor-free Small-scale Multispectral Pedestrian DetectionAlexander Wolpert, Michael Teutsch, M. Saquib Sarfraz, Rainer Stiefelhagen. bmvc 2020: [doi]

2018

Reconstruction of Boolean Formulas in Conjunctive Normal FormEvgeny Dantsin, Alexander Wolpert. cocoon 2018: 592-601 [doi]

2017

Lifetact: utilizing smartwatches as tactile heartbeat displays in video gamesErik Pescara, Alexander Wolpert, Matthias Budde, Andrea Schankin, Michael Beigl. mum 2017: 97-101 [doi]

2013

Exponential Complexity of Satisfiability Testing for Linear-Size Boolean FormulasEvgeny Dantsin, Alexander Wolpert. ciac 2013: 110-121 [doi]

2010

On Moderately Exponential Time for SATEvgeny Dantsin, Alexander Wolpert. sat 2010: 313-325 [doi]

2006

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause LengthEvgeny Dantsin, Alexander Wolpert. jsat, 1(1):49-60, 2006. [doi]

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s:::2:::) TimeEvgeny Dantsin, Alexander Wolpert. sat 2006: 266-276 [doi]

Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT AlgorithmsEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. ciac 2006: 60-68 [doi]

Population Variance under Interval Uncertainty: A New AlgorithmEvgeny Dantsin, Vladik Kreinovich, Alexander Wolpert, Gang Xiang. rc, 12(4):273-280, 2006. [doi]

Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problemsEvgeny Dantsin, Alexander Wolpert, Vladik Kreinovich. SAC 2006: 1640-1644 [doi]

2005

2004

2003

A Robust Dna Computation Model That Captures PspaceEvgeny Dantsin, Alexander Wolpert. ijfcs, 14(5):933, 2003. [doi]

Algorithms for SAT based on search in Hamming ballsEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. eccc, (072), 2003. [doi]

2002

Solving Constraint Satisfaction Problems with DNA ComputingEvgeny Dantsin, Alexander Wolpert. cocoon 2002: 171-180 [doi]

Sign in or sign up to see more results.

runs on WebDSL