A. Razborov

发表

On 3-Hypergraphs with Forbidden 4-Vertex Configurations

Alexander A. Razborov, A. Razborov, 2010, SIAM J. Discret. Math..

On the Parameterization of solutions for equations in Free Groups

Alexander A. Razborov, A. Razborov, 1993, Int. J. Algebra Comput..

Communication Complexity

A. Razborov, 2011 .

Quantum communication complexity of symmetric predicates

A. Razborov, 2002, quant-ph/0204025.

Clique is hard on average for regular resolution

Alexander A. Razborov, Albert Atserias, Susanna F. de Rezende, 2018, STOC.

Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

A. Razborov, 1987 .

Space complexity in propositional calculus

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2000, STOC '00.

Improved lower bounds on the rigidity of Hadamard matrices

A. Razborov, B. Kashin, 1998 .

Lower bounds on monotone complexity of the logical permanent

A. Razborov, 1985 .

Bounded Arithmetic and Lower Bounds in Boolean Complexity

A. Razborov, 1995 .

Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

Jan Krajícek, Alexander A. Razborov, Samuel R. Buss, 1997, computational complexity.

Non-Three-Colourable Common Graphs Exist

Jan Hladký, Daniel Král, Alexander A. Razborov, 2011, Combinatorics, Probability and Computing.

On submodular complexity measures

A. Razborov, 1992 .

ON SYSTEMS OF EQUATIONS IN A FREE GROUP

A. Razborov, 1985 .

Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic

A. Razborov, 1995 .

An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval

Alexander A. Razborov, Sergey Yekhanin, A. Razborov, 2007, Theory of Computing.

Electronic Colloquium on Computational Complexity, Report No. 75 (2001) Resolution Lower Bounds for the Weak Functional Pigeonhole Principle

Alexander A. Razborov, A. Razborov, 2001 .

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus

A. Yao, A. Wigderson, A. Razborov, 2002 .

On the Distributional Complexity of Disjointness

Alexander A. Razborov, A. Razborov, 1992, Theor. Comput. Sci..

The Sign-Rank of AC^O

Alexander A. Razborov, Alexander A. Sherstov, A. Razborov, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

The Sign-rank of Ac

Alexander A. Sherstov, A. Razborov, 2008 .

On Turán’s (3,4)-problem with forbidden subgraphs

A. Razborov, 2014 .

Almost Euclidean subspaces of e N 1 via expander codes

James R. Lee, A. Razborov, V. Guruswami, 2008, SODA 2008.

Diameter of Polyhedra: Limits of Abstraction

A. Razborov, F. Eisenbrand, T. Rothvoss, 2010 .

n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom

Alexander A. Razborov, Avi Wigderson, A. Wigderson, 1993, Information Processing Letters.

An Ω ( n 1 / 3 ) Lower Bound for Bilinear Group Based Private Information Retrieval

A. Razborov, S. Yekhanin, 2006 .

Almost Euclidean subspaces of $\ell_1^N$ via expander codes.

James R. Lee, A. Razborov, V. Guruswami, 2007 .

Polynomial to exponential transition in Ramsey theory

D. Mubayi, A. Razborov, 2019, Proceedings of the London Mathematical Society.

What is... a flag algebra

Alexander A. Razborov, A. Razborov, 2013 .

COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: Lower estimates of the dimension of schemes of bounded depth in the basis \{\&,\vee,\oplus\}

A. Razborov, A A Razborov, 1986 .

An Ω(n) Lower Bound for Bilinear Group Based Private Information Retrieval

A. Razborov, S. Yekhanin, 2008 .

Sergei Ivanovich Adian (on his 75th birthday)

A. L. Semenov, A. Razborov, V. Uspenskii, 2006 .

Quasirandom Structures

A. Razborov, Dylan Quintana, 2017 .

Natural quasirandomness properties

A. Razborov, L. N. Coregliano, Alexander A. Razborov, 2020, Random Struct. Algorithms.

Pseudorandom generators hard for $k$-DNF resolution and polynomial calculus resolution

Alexander A. Razborov, A. Razborov, 2015 .

Diameter of Polyhedra : Limits of Abstraction Friedrich Eisenbrand

A. Razborov, T. Rothvoss, Nicolai Hähnle, 2010 .

An extremal problem motivated by triangle-free strongly regular graphs

A. Razborov, 2020, J. Comb. Theory, Ser. B.

A product theorem in free groups

A. Razborov, 2014 .

2010 north american annual meeting of the association for symbolic logic

N. P. Landsman, H. Towsner, A. Razborov, 2011 .

Testing Properties of Boolean Functions : Lower Bounds on Testing Fourier Degree

A. Razborov, Pooya Hatami, P. Hatami, 2011 .

0 A pr 2 00 2 Quantum Communication Complexity of Symmetric Predicates

A. Razborov, 2003 .

Analytic and pseudo-analytic structures

A. Razborov, R. Cori, S. Todorcevic, 2016 .

Quantum Computing

Jose Luis Hevia, A. Razborov, G. Peterssen, 2005, IEEE Software.

Akademiai Kiad6 -Springer-Verlag APPLICATIONS OF MATRIX METHODS ÒÎ ÒÍÅ THEORY OF LOWER BOUNDS IN COMPUTATIONAL COMPLEXITY À. À. RAZBOROV

A. Razborov, 1988 .

Themes Complexity Theory ’ 94 In the months of August and September , 1994

S. Safra, M. Ben-Or, M. Paterson, 2022 .

Timed Modal Specifications........ 8

S. Safra, M. Ben-Or, Oded Goldreich, 2022 .

Quantum communication complexity of symmetric predicates

A. Razborov, 2002, quant-ph/0204025.

Parameterized Bounded-Depth Frege Is not Optimal

Alexander A. Razborov, Olaf Beyersdorff, Massimo Lauria, 2011, TOCT.

An upper bound on the threshold quantum decoherence rate

A. Razborov, 2003, Quantum information & computation.

Special Issue In Memory of Misha Alekhnovich. Foreword

Allan Borodin, Alexander A. Razborov, Toniann Pitassi, 2011, computational complexity.

Sergei Ivanovich Adian

Alexander A. Razborov, Lev D. Beklemishev, Sergei Petrovich Novikov, 2021 .

Upper and lower bounds for nilpotency classes of Lie algebras with Engel conditions

S. I. Adian, A. Razborov, N. Repin, 1989 .

Quantum communication complexity of symmetric predicates

Alexander A. Razborov, Александр Александрович Разборов, A. Razborov, 2002, quant-ph/0204025.

Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings

Alexander A. Razborov, Anatol Slissenko, Edward A. Hirsch, 2008, CSR.

Proceedings of the 3rd international conference on Computer science: theory and applications

Alexander A. Razborov, Anatol Slissenko, Edward A. Hirsch, 2008 .

One Property of Cross-Intersecting Families

Nikolai K. Vereshchagin, Alexander A. Razborov, A. Razborov, 1999, Electron. Colloquium Comput. Complex..

Feasible proofs and computations: partnership and fusion

Alexander A. Razborov, A. Razborov, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

On Turán’s (3,4)-problem with forbidden subgraphs

A. Razborov, 2014, Mathematical Notes.

On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution

A. Razborov, Jakob Nordström, 2009, ICALP.

A two-dimensional tree ideal

A. Razborov, R. Cori, S. Todorcevic, 2016 .

Improved Convergence Guarantees for Shallow Neural Networks

A. Razborov, 2022, ArXiv.

On the AC 0 Complexity of Subgraph Isomorphism Yuan Li

A. Razborov, Benjamin Rossman, 2014 .

Andrei Nikolaevich Kolmogorov (1903–1987)

D. Kendall, G. Lorentz, P. Whittle, 1990 .

More about sparse halves in triangle-free graphs

Alexander Razborov, A. Razborov, 2021, 2104.09406.

A New Kind of Tradeoffs in Propositional Proof Complexity

Alexander A. Razborov, A. Razborov, 2016, J. ACM.

Feasible proofs and computations: partnership and fusion

A. Razborov, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

Complexity of Propositional Proofs

Alexander A. Razborov, A. Razborov, 2010, CSR.

Resolution lower bounds for perfect matching principles

Alexander A. Razborov, A. Razborov, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Resolution is not automatizable unless W[P] is tractable

Michael Alekhnovich, Alexander A. Razborov, A. Razborov, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Lower bounds for the polynomial calculus

Alexander A. Razborov, A. Razborov, 1998, computational complexity.

Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic

Alexander A. Razborov, A. Razborov, 1996, ICALP.

Natural Proofs

Alexander A. Razborov, Steven Rudich, A. Razborov, 2007 .

Lower bounds for polynomial calculus: non-binomial case

Michael Alekhnovich, Alexander A. Razborov, A. Razborov, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Pseudorandom generators in propositional proof complexity

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Applications of matrix methods to the theory of lower bounds in computational complexity

Alexander A. Razborov, A. Razborov, 1990, Comb..

On the method of approximations

Alexander A. Razborov, A. Razborov, 1989, STOC '89.

Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields

Alexander A. Razborov, Dima Grigoriev, A. Razborov, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

On Small Depth Threshold Circuits

Alexander A. Razborov, A. Razborov, 1992, SWAT.

Majority gates vs. general weighted threshold gates

Alexander A. Razborov, Johan Håstad, Mikael Goldmann, 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

Real Advantage

Emanuele Viola, Alexander A. Razborov, A. Razborov, 2013, TOCT.

Periodic groups and Lie algebras

S. I. Adian, A. Razborov, 1987 .

Semantic limits of dense combinatorial objects pdf

Alexander A. Razborov, Leonardo N. Coregliano, A. Razborov, 2019, Russian Mathematical Surveys.

Almost Euclidean subspaces of ℓ1N VIA expander codes

Venkatesan Guruswami, James R. Lee, Alexander A. Razborov, 2007, SODA '08.

The future of computational complexity theory: part I

Oded Goldreich, A. Wigderson, C. Papadimitriou, 1996, SIGA.

The Sign-Rank of AC0

Alexander A. Razborov, Alexander A. Sherstov, A. Razborov, 2010, SIAM J. Comput..

Notions of computability at higher types I

Stevo Todorcevic, Carol Wood, John R. Longley, 2016 .

Lower Bounds for Deterministic and Nondeterministic Branching Programs

Alexander A. Razborov, A. Razborov, 1991, FCT.

On provably disjoint NP-pairs

Alexander A. Razborov, A. Razborov, 1994, Electron. Colloquium Comput. Complex..

On the Minimal Density of Triangles in Graphs

Alexander A. Razborov, A. Razborov, 2008, Combinatorics, Probability and Computing.

Why are there so many loop formulas?

Alexander A. Razborov, Vladimir Lifschitz, V. Lifschitz, 2006, TOCL.

The P \mathop = \limits^? NP-Problem: A View from the 1990s

A. A. Razborov, A. Razborov, 2006 .

On the AC0 Complexity of Subgraph Isomorphism

Alexander A. Razborov, Yuan Li, Benjamin Rossman, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

Natural Proofs

A. Razborov, S. Rudich, 1994, Electron. Colloquium Comput. Complex..

Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus

Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao, 1997, STOC '97.

An \Omega(n^1/3 ) Lower Bound for Bilinear Group Based Private Information Retrieval

Alexander A. Razborov, Sergey Yekhanin, A. Razborov, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

The Set of Minimal Braids is co-NP-Complete

Alexander A. Razborov, Mike Paterson, M. Paterson, 1991, J. Algorithms.

The Sign-rank of Ac

Alexander A. Sherstov, A. Razborov, 2008 .

Flag Algebras: An Interim Report

Alexander A. Razborov, A. Razborov, 2013, The Mathematics of Paul Erdős II.

Electronic Colloquium on Computational Complexity Natural Proofs

A. Razborov, Alexander A. Razborovy, Steven Rudichz, 2022 .

Proof Complexity of Pigeonhole Principles

Alexander A. Razborov, A. Razborov, 2001, Developments in Language Theory.

On CDCL-Based Proof Systems with the Ordered Decision Strategy

Shuo Pang, Alexander Razborov, Nathan Mull, 2019, SAT.

Satisfiability, Branch-Width and Tseitin tautologies

Michael Alekhnovich, Alexander A. Razborov, A. Razborov, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Bounded Arithmetic and Lower Bounds in Boolean Complexity

A. Razborov, 1995 .

Constructing Small Sets that are Uniform in Arithmetic Progressions

Endre Szemerédi, Alexander A. Razborov, Avi Wigderson, 1993, Combinatorics, Probability and Computing.

On Space and Depth in Resolution

A. Razborov, 2018, computational complexity.