Searching for authors named "Evgeny Dantsin" – sorted by Relevance.
-
A Robust Dna Computation Model That Captures Pspace
- ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE EVGENY DANTSIN and ALEXANDER WOLPERT School
- Add To MetaCart
-
Open Software Foundation. OSF DCE Application Developement Guide
- -Shortening Algorithm for SAT with No Restriction on Clause Length Evgeny Dantsin edantsin@(email omitted); Alexander
- Cited by 1 (1 self) – Add To MetaCart
-
An improved upper bound for SAT
- An Improved Upper Bound for SAT Evgeny Dantsin and Alexander Wolpert Roosevelt University 430 S
- Cited by 3 (1 self) – Add To MetaCart
-
MAX-SAT for formulas with constant clause density can be solved faster than in O(2 n ) time
- Dantsin 1 and Alexander Wolpert 1 Roosevelt University, 430 S. Michigan Av., Chicago, IL 60605, USA
- Cited by 3 (0 self) – Add To MetaCart
-
Complexity of Query Answering in Logic Databases with Complex Values
- -0686 Complexity of Query Answering in Logic Databases with Complex Values Evgeny Dantsin Steklov Institute
- Cited by 11 (5 self) – Add To MetaCart
-
Bag and Set Unification
- UPMAIL Technical Report No. 150 November 27, 1997 Bag and Set Unification Evgeny Dantsin Steklov
- Cited by 1 (1 self) – Add To MetaCart
-
Solving constraint satisfaction problems with DNA computing
- Solving Constraint Satisfaction Problems with DNA Computing Evgeny Dantsin and Alexander Wolpert
- Cited by 2 (1 self) – Add To MetaCart
-
Expressive Power and Data Complexity of Nonrecursive Logic Programming
- and data complexity of nonrecursive logic programming Evgeny Dantsin Andrei Voronkov Computing Science
- Cited by 5 (0 self) – Add To MetaCart
-
Derandomization of Schuler’s algorithm for SAT
- Derandomization of Schuler’s Algorithm for SAT Evgeny Dantsin and Alexander Wolpert Roosevelt
- Cited by 9 (5 self) – Add To MetaCart
-
Complexity and Expressive Power of Logic
- Complexity and Expressive Power of Logic Programming Evgeny Dantsin (University of Manchester
- Add To MetaCart

