The following pages link to Alexander A. Razborov (Q1370854):
Displaying 50 items.
- (Q430829) (redirect page) (← links)
- (Q1071000) (redirect page) (← links)
- (Q1130184) (redirect page) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Lower bounds on monotone complexity of the logical permanent (Q1071001) (← links)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition (Q1095871) (← links)
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits (Q1173769) (← links)
- The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear (Q1201273) (← links)
- On the distributional complexity of disjointness (Q1202933) (← links)
- Majority gates vs. general weighted threshold gates (Q1210330) (← links)
- Improved lower bounds on the rigidity of Hadamard matrices (Q1280658) (← links)
- Lower bounds for the polynomial calculus (Q1293358) (← links)
- On the shrinkage exponent for read-once formulae (Q1367534) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Resolution lower bounds for the weak functional pigeonhole principle. (Q1401365) (← links)
- Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus (Q1416118) (← links)
- Lower bounds for polynomial calculus in the case of nonbinomial ideals. (Q1432645) (← links)
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. (Q1573765) (← links)
- On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs (Q1587348) (← links)
- On space and depth in resolution (Q1616620) (← links)
- Resolution lower bounds for perfect matching principles (Q1881260) (← links)
- On the number of pentagons in triangle-free graphs (Q1940382) (← links)
- An extremal problem motivated by triangle-free strongly regular graphs (Q2131859) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- On Turán's \((3,4)\)-problem with forbidden subgraphs (Q2341979) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- A product theorem in free groups. (Q2445314) (← links)
- On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem (Q2510770) (← links)
- Applications of matrix methods to the theory of lower bounds in computational complexity (Q2638784) (← links)
- On CDCL-based proof systems with the ordered decision strategy (Q2661344) (← links)
- (Q2785568) (← links)
- On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs (Q2853341) (← links)
- Non-Three-Colourable Common Graphs Exist (Q2911071) (← links)
- A Simple Proof of Bazzi’s Theorem (Q2947540) (← links)
- Parameterized Bounded-Depth Frege Is not Optimal (Q2947567) (← links)
- Real Advantage (Q2947588) (← links)
- (Q3002789) (← links)
- Sergei Ivanovich Adian (on his eightieth birthday) (Q3008002) (← links)
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations (Q3008019) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
- Periodic groups and Lie algebras (Q3030984) (← links)
- The Sign-Rank of AC$^0$ (Q3053151) (← links)
- (Q3140640) (← links)
- Space Complexity in Propositional Calculus (Q3149864) (← links)
- Diameter of Polyhedra: Limits of Abstraction (Q3169119) (← links)
- A New Kind of Tradeoffs in Propositional Proof Complexity (Q3177773) (← links)
- Space complexity in propositional calculus (Q3192004) (← links)
- WHAT IS... a Flag Algebra? (Q3193047) (← links)
