| Publication | Date of Publication | Type |
|---|
| The parallel complexity of approximating the High Degree Subgraph problem | 2023-03-21 | Paper |
Efficient constructions of hitting sets for systems of linear functions
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Automata, Languages and Programming | 2018-07-04 | Paper |
Optimal bounds on the approximation of Boolean functions with consequences on the concept of hardness
STACS 96 | 2017-11-16 | Paper |
On algorithm complexity
Journal of Mathematical Sciences (New York) | 2014-06-06 | Paper |
Test recognition
Journal of Mathematical Sciences (New York) | 2011-06-30 | Paper |
Very large cliques are easy to detect
Discrete Mathematics | 2008-07-11 | Paper |
| Theory of test recognition | 2008-06-12 | Paper |
| scientific article; zbMATH DE number 2102761 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 1405644 (Why is no real title available?) | 2000-07-10 | Paper |
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Theoretical Computer Science | 2000-01-12 | Paper |
Weak Random Sources, Hitting Sets, and BPP Simulations
SIAM Journal on Computing | 1999-10-28 | Paper |
On linear hashing of binary sets
Moscow University Mathematics Bulletin | 1999-03-15 | Paper |
The parallel complexity of approximating the high degree subgraph problem
Theoretical Computer Science | 1999-01-12 | Paper |
A new general derandomization method
Journal of the ACM | 1999-01-05 | Paper |
Optimal bounds for the approximation of Boolean functions and some applications
Theoretical Computer Science | 1998-07-22 | Paper |
Complexity of automata evaluating formulas
Moscow University Mathematics Bulletin | 1998-03-29 | Paper |
A nearly-optimal transfixing set
Doklady Mathematics | 1998-03-11 | Paper |
On a formula synthesizing method
Moscow University Mathematics Bulletin | 1997-07-01 | Paper |
Statistical estimation of the structure of a finite population
Discrete Mathematics and Applications | 1997-03-23 | Paper |
Statistical estimation of the structure of a finite population
Discrete Mathematics and Applications | 1997-03-23 | Paper |
Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 921052 (Why is no real title available?) | 1996-08-27 | Paper |
On the complexity of gradient gate circuits
Discrete Mathematics and Applications | 1996-01-15 | Paper |
Bounds for code length for circuits of functional elements
Discrete Mathematics and Applications | 1995-05-22 | Paper |
| scientific article; zbMATH DE number 726918 (Why is no real title available?) | 1995-03-23 | Paper |
| scientific article; zbMATH DE number 4172391 (Why is no real title available?) | 1991-01-01 | Paper |
On the complexity of realization of partial Boolean functions by circuits of functional elements
Discrete Mathematics and Applications | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4187721 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4097289 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4031582 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049557 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4047105 (Why is no real title available?) | 1987-01-01 | Paper |
A method for obtaining more than quadratic effective lower estimates of complexity of schemes
Moscow University Mathematics Bulletin | 1987-01-01 | Paper |
A method for obtaining efficient lower bounds for monotone complexity
Algebra and Logic | 1987-01-01 | Paper |
The complexity of the realization of subdefinite matrices by gate schemes
Mathematical Notes | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3974967 (Why is no real title available?) | 1986-01-01 | Paper |
On a family of Boolean matrices
Moscow University Mathematics Bulletin | 1986-01-01 | Paper |
A UNIVERSAL PRINCIPLE OF SELF-CORRECTION
Mathematics of the USSR-Sbornik | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3999837 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3926816 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3910306 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3981091 (Why is no real title available?) | 1985-01-01 | Paper |
On a modification of the gradient algorithm
Moscow University Mathematics Bulletin | 1985-01-01 | Paper |
On the number of maximum intervals
Moscow University Mathematics Bulletin | 1985-01-01 | Paper |
Complexity of monotonic functions
Moscow University Mechanics Bulletin | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3903997 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3930904 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3968507 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3887605 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3767083 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3767082 (Why is no real title available?) | 1980-01-01 | Paper |
