Razborov*, Alexander
93  results:
Search for persons X
?
 
?
2

Natural quasirandomness properties:

Coregliano, Leonardo N. ; Razborov, Alexander A.
Random Structures & Algorithms.  63 (2023)  3 - p. 624-688 , 2023
 
?
3

An Interview with Alexander Razborov: Conducted by Karen Hu..:

Razborov, Alexander
The Mathematical Intelligencer.  44 (2022)  3 - p. 193-202 , 2022
 
?
4

An extremal problem motivated by triangle-free strongly reg..:

Razborov, Alexander
Journal of Combinatorial Theory, Series B.  155 (2022)  - p. 52-82 , 2022
 
?
7

On CDCL-Based Proof Systems with the Ordered Decision Strat..:

, In: Theory and Applications of Satisfiability Testing – SAT 2020; Lecture Notes in Computer Science,
Mull, Nathan ; Pang, Shuo ; Razborov, Alexander - p. 149-165 , 2020
 
?
8

Polynomial to exponential transition in Ramsey theory:

Mubayi, Dhruv ; Razborov, Alexander
Proceedings of the London Mathematical Society.  122 (2020)  1 - p. 69-92 , 2020
 
?
9

Proof Complexity and Beyond:

Atserias, Albert ; Nordström, Jakob ; Pitassi, Toniann.
Oberwolfach Reports.  14 (2018)  3 - p. 2299-2361 , 2018
 
?
10

Clique is hard on average for regular resolution:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
 
?
11

On the Width of Semialgebraic Proofs and Algorithms:

Razborov, Alexander
Mathematics of Operations Research.  42 (2017)  4 - p. 1106-1134 , 2017
 
?
12

On the $AC^0$ Complexity of Subgraph Isomorphism:

Li, Yuan ; Razborov, Alexander ; Rossman, Benjamin
SIAM Journal on Computing.  46 (2017)  3 - p. 936-971 , 2017
 
?
13

On Space and Depth in Resolution:

Razborov, Alexander
computational complexity.  27 (2017)  3 - p. 511-559 , 2017
 
?
14

Guest Column: Proof Complexity and Beyond:

Razborov, Alexander
ACM SIGACT News.  47 (2016)  2 - p. 66-86 , 2016
 
?
15

A New Kind of Tradeoffs in Propositional Proof Complexity:

Razborov, Alexander
Journal of the ACM (JACM).  63 (2016)  2 - p. 1-14 , 2016
 
1-15