Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Alexander Wolpert is active.

Publication


Featured researches published by Alexander Wolpert.


Reliable Computing | 2006

Population Variance under Interval Uncertainty: A New Algorithm

Evgeny Dantsin; Vladik Kreinovich; Alexander Wolpert; Gang Xiang

In statistical analysis of measurement results, it is often beneficial to compute the range V of the population variance


theory and applications of satisfiability testing | 2006

MAX-SAT for formulas with constant clause density can be solved faster than in O (2 n ) time

Evgeny Dantsin; Alexander Wolpert


theory and applications of satisfiability testing | 2005

An improved upper bound for SAT

Evgeny Dantsin; Alexander Wolpert

v=\frac{1}{2}\cdot\sum^{n}_{i=1}(x_{i}-E)^{2}\,(where E=\frac{1}{n}\sum^{n}_{i=1}x_{i})


theory and applications of satisfiability testing | 2004

Derandomization of schuler’s algorithm for SAT

Evgeny Dantsin; Alexander Wolpert


theory and applications of satisfiability testing | 2010

On moderately exponential time for SAT

Evgeny Dantsin; Alexander Wolpert

when we only know the intervals


International Journal of Foundations of Computer Science | 2003

A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE

Evgeny Dantsin; Alexander Wolpert


Sigact News | 2005

On quantum versions of record-breaking algorithms for SAT

Evgeny Dantsin; Vladik Kreinovich; Alexander Wolpert

[{\tilde x}_{i}-\Delta_{i},{\tilde x}_{i}+\Delta_{i}]


international conference on algorithms and complexity | 2013

Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas

Evgeny Dantsin; Alexander Wolpert


computing and combinatorics conference | 2002

Solving Constraint Satisfaction Problems with DNA Computing

Evgeny Dantsin; Alexander Wolpert

of possible values of the xi. In general, this problem is NP-hard; a polynomialtime algorithm is known for the case when the measurements are sufficiently accurate, i.e., when


computing and combinatorics conference | 2018

Reconstruction of Boolean Formulas in Conjunctive Normal Form

Evgeny Dantsin; Alexander Wolpert

Collaboration


Dive into the Alexander Wolpert's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Vladik Kreinovich

University of Texas at El Paso

View shared research outputs
Top Co-Authors

Avatar

Edward A. Hirsch

St. Petersburg Department of Steklov Institute of Mathematics

View shared research outputs
Top Co-Authors

Avatar

Gang Xiang

University of Texas at El Paso

View shared research outputs
Top Co-Authors

Avatar

Martine Ceberio

University of Texas at El Paso

View shared research outputs
Researchain Logo
Decentralizing Knowledge