( en | de | ru )

 

Disambiguation of "Razborov, Alexander A."

Author of the publication

copydeleteadd this publication to your clipboard
Clique Is Hard on Average for Regular Resolution.

, , , , , and . CoRR, (2020)

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

Lower Bounds for Deterministic and Nondeterministic Branching Programs.. FCT, volume 529 of Lecture Notes in Computer Science, page 47-60. Springer, (1991)Flag algebras.. J. Symb. Log., 72 (4): 1239-1282 (2007)A simple proof of Bazzi's theorem. Electronic Colloquium on Computational Complexity (ECCC), (2009)Lower Bounds for Polynomial Calculus: Non-Binomial Case., and . FOCS, page 190-199. IEEE Computer Society, (2001)On O versus NP co-NP for Decision Trees and Read-Once Branching Programs., , , and . MFCS, volume 1295 of Lecture Notes in Computer Science, page 319-326. Springer, (1997)Asymptotic Structure of Graphs with the Minimum Number of Triangles., and . Comb. Probab. Comput., 26 (1): 138-160 (2017)Almost Euclidean subspaces of ℓ1N via expander codes., , and . Electron. Colloquium Comput. Complex., (2007)An extremal problem motivated by triangle-free strongly regular graphs.. J. Comb. Theory B, (2022)On the Density of Transitive Tournaments., and . J. Graph Theory, 85 (1): 12-21 (2017)Preface., , and . Theory Comput. Syst., 46 (4): 619 (2010)