( en | de | ru )

 

Disambiguation of "Razborov, Alexander A."

Author of the publication

copydeleteadd this publication to your clipboard
The future of computational complexity theory: part I.

, , , , and . SIGACT News, 27 (3): 6-12 (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander A Borbély

Alexander A Bialasiewicz

Alexander Foss°a

Alexander A Beyer

Alexander A Bialasiewicz

 

Other publications of authors with the same name

The Ackermann Award 2009., and . CSL, volume 5771 of Lecture Notes in Computer Science, page 561-565. Springer, (2009)On the Parameterization of solutions for equations in Free Groups.. Int. J. Algebra Comput., 3 (3): 251-274 (1993)Constructing Small Sets that are Uniform in Arithmetic Progressions., , and . Comb. Probab. Comput., (1993)Pseudorandom Generators in Propositional Proof Complexity., , , and . SIAM J. Comput., 34 (1): 67-88 (2004)On the Shrinkage Exponent for Read-Once Formulae., , and . Theor. Comput. Sci., 141 (1&2): 269-282 (1995)Clique Is Hard on Average for Regular Resolution., , , , , and . CoRR, (2020)Diameter of Polyhedra: Limits of Abstraction., , , and . Flexible Network Design, volume 10211 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Space Characterizations of Complexity Measures and Size-Space Trade-Offs in Propositional Proof Systems., and . ICALP, volume 229 of LIPIcs, page 100:1-100:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Majority Gates vs. General Weighted Threshold Gates., , and . SCT, page 2-13. IEEE Computer Society, (1992)Satisfiability, Branch-Width and Tseitin Tautologies., and . FOCS, page 593-603. IEEE Computer Society, (2002)