E. Ya. Dantsin

Available identifiers

zbMath Open dantsin.evgenyMaRDI QIDQ234708

List of research outcomes

Publication	Date of Publication	Type
Gregory Samuilovich Tseytin (obituary)	2024-01-25	Paper
An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF	2023-07-11	Paper
Handling uncertainty when getting contradictory advice from experts	2020-12-15	Paper
Reconstruction of Boolean formulas in conjunctive normal form	2018-10-04	Paper
Obituary: Nikolai Aleksandrovich Shanin (1919--2011)	2013-12-17	Paper
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas	2013-06-07	Paper
https://portal.mardi4nfdi.de/entity/Q3108190	2012-01-01	Paper
Satisfiability Certificates Verifiable in Subexponential Time	2011-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q3001095	2011-05-31	Paper
On Moderately Exponential Time for SAT	2010-09-29	Paper
STACS 2004	2007-10-01	Paper
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time	2007-09-04	Paper
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms	2007-05-02	Paper
https://portal.mardi4nfdi.de/entity/Q3429016	2007-03-30	Paper
Population variance under interval uncertainty: a new algorithm	2006-09-14	Paper
Theory and Applications of Satisfiability Testing	2005-12-16	Paper
Theory and Applications of Satisfiability Testing	2005-12-15	Paper
A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE	2005-10-19	Paper
Algorithms for Sat and upper bounds on their complexity	2005-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q4808635	2004-08-12	Paper
Nikolai Aleksandrovich Shanin (on his 80th birthday)	2003-08-28	Paper
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.	2003-01-21	Paper
MAX SAT approximation beyond the limits of polynomial-time approximation	2002-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q2754147	2001-11-11	Paper
Probabilistic verification of proofs in calculuses	2000-06-06	Paper
Randomized proofs in arithmetic	1999-11-22	Paper
https://portal.mardi4nfdi.de/entity/Q4260706	1999-09-01	Paper
A language for visual knowledge representation in computer-aided knowledge engineering technology	1998-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q4209085	1998-10-14	Paper
https://portal.mardi4nfdi.de/entity/Q3352546	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3200587	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3777498	1987-01-01	Paper
Two systems for proving tautologies, based on the split method	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3931248	1981-01-01	Paper
On an approximative version of the notion of constructive analytic function	1980-01-01	Paper

Research outcomes over time

This page was built for person: E. Ya. Dantsin