The following pages link to Evgeny Dantsin (Q234708):
Displaying 36 items.
- (Q1147144) (redirect page) (← links)
- On an approximative version of the notion of constructive analytic function (Q1147145) (← links)
- A language for visual knowledge representation in computer-aided knowledge engineering technology (Q1390646) (← links)
- Reconstruction of Boolean formulas in conjunctive normal form (Q1791022) (← links)
- Randomized proofs in arithmetic (Q1807460) (← links)
- Two systems for proving tautologies, based on the split method (Q1838470) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Probabilistic verification of proofs in calculuses (Q1977920) (← links)
- Handling uncertainty when getting contradictory advice from experts (Q2215920) (← links)
- Algorithms for Sat and upper bounds on their complexity (Q2487388) (← links)
- Population variance under interval uncertainty: a new algorithm (Q2503169) (← links)
- (Q2754147) (← links)
- Nikolai Aleksandrovich Shanin (obituary) (Q2868459) (← links)
- (Q3001095) (← links)
- Satisfiability Certificates Verifiable in Subexponential Time (Q3007671) (← links)
- (Q3108190) (← links)
- (Q3200587) (← links)
- (Q3352546) (← links)
- (Q3429016) (← links)
- Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms (Q3434543) (← links)
- (Q3777498) (← links)
- (Q3931248) (← links)
- (Q4209085) (← links)
- (Q4260706) (← links)
- Nikolai Aleksandrovich Shanin (on his 80th birthday) (Q4709962) (← links)
- (Q4808635) (← links)
- Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas (Q4924642) (← links)
- On Moderately Exponential Time for SAT (Q4930599) (← links)
- STACS 2004 (Q5309695) (← links)
- A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE (Q5696946) (← links)
- Theory and Applications of Satisfiability Testing (Q5713730) (← links)
- Theory and Applications of Satisfiability Testing (Q5714775) (← links)
- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time (Q5756576) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
- An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF (Q6113549) (← links)
- Gregory Samuilovich Tseytin (obituary) (Q6184487) (← links)
