| Publication | Date of Publication | Type |
|---|
Gregory Samuilovich Tseytin (obituary)
Russian Mathematical Surveys | 2024-01-25 | Paper |
An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF
Journal on Satisfiability, Boolean Modeling and Computation | 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)
Russian Mathematical Surveys | 2013-12-17 | Paper |
Exponential complexity of satisfiability testing for linear-size Boolean formulas
Lecture Notes in Computer Science | 2013-06-07 | Paper |
| scientific article; zbMATH DE number 5993862 (Why is no real title available?) | 2012-01-01 | Paper |
Satisfiability certificates verifiable in subexponential time
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
| Maximum satisfiability and subexponential time | 2011-05-31 | Paper |
On moderately exponential time for SAT
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
Lecture Notes in Computer Science | 2007-05-02 | Paper |
| A faster clause-shortening algorithm for SAT with no restriction on clause length | 2007-03-30 | Paper |
Population variance under interval uncertainty: a new algorithm
Reliable Computing | 2006-09-14 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Algorithms for Sat and upper bounds on their complexity
Journal of Mathematical Sciences (New York) | 2005-08-05 | Paper |
| scientific article; zbMATH DE number 2089972 (Why is no real title available?) | 2004-08-12 | Paper |
Nikolai Aleksandrovich Shanin (on his 80th birthday)
Russian Mathematical Surveys | 2003-08-28 | Paper |
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
Theoretical Computer Science | 2003-01-21 | Paper |
MAX SAT approximation beyond the limits of polynomial-time approximation
Annals of Pure and Applied Logic | 2002-03-13 | Paper |
| scientific article; zbMATH DE number 1670827 (Why is no real title available?) | 2001-11-11 | Paper |
Probabilistic verification of proofs in calculuses
Journal of Mathematical Sciences (New York) | 2000-06-06 | Paper |
Randomized proofs in arithmetic
Journal of Mathematical Sciences (New York) | 1999-11-22 | Paper |
| scientific article; zbMATH DE number 1330135 (Why is no real title available?) | 1999-09-01 | Paper |
A language for visual knowledge representation in computer-aided knowledge engineering technology
Journal of Computer and Systems Sciences International | 1998-10-18 | Paper |
| scientific article; zbMATH DE number 1206044 (Why is no real title available?) | 1998-10-14 | Paper |
| scientific article; zbMATH DE number 4203776 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4176494 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4039349 (Why is no real title available?) | 1987-01-01 | Paper |
Two systems for proving tautologies, based on the split method
Journal of Soviet Mathematics | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3747068 (Why is no real title available?) | 1981-01-01 | Paper |
On an approximative version of the notion of constructive analytic function
Journal of Soviet Mathematics | 1980-01-01 | Paper |
