Travelled to:1 × Austria
1 × Canada
1 × Germany
1 × Switzerland
2 × Finland
3 × USA
Collaborated with:∅ A.Wigderson J.Nordström S.Rudich A.C.Yao O.Beyersdorff N.Galesi M.Lauria M.Alekhnovich E.Ben-Sasson
Talks about:proof (6) complex (3) bound (3) partnership (2) pigeonhol (2) proposit (2) principl (2) calculus (2) feasibl (2) fusion (2)
Person: Alexander A. Razborov
DBLP: Razborov:Alexander_A=
Contributed to:
20112004
2004
2001
200019971996199419901989Wrote 11 papers:
- ICALP-v1-2011-BeyersdorffGLR #bound
- Parameterized Bounded-Depth Frege Is Not Optimal (OB, NG, ML, AAR), pp. 630–641.
- ICALP-v1-2011-NordstromR #on the #satisfiability #trade-off
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (JN, AAR), pp. 642–653.
- ICALP-2004-Razborov #proving
- Feasible Proofs and Computations: Partnership and Fusion (AAR), pp. 8–14.
- LICS-2004-Razborov #proving
- Feasible Proofs and Computations: Partnership and Fusion (AAR), pp. 134–138.
- DLT-2001-Razborov #complexity #proving
- Proof Complexity of Pigeonhole Principles (AAR), pp. 100–116.
- STOC-2000-AlekhnovichBRW #calculus #complexity
- Space complexity in propositional calculus (MA, EBS, AAR, AW), pp. 358–367.
- STOC-1997-RazborovWY #branch #calculus #proving #source code
- Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus (AAR, AW, ACCY), pp. 739–748.
- ICALP-1996-Razborov #bound #independence #proving
- Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (AAR), pp. 48–62.
- STOC-1994-RazborovR #proving
- Natural proofs (AAR, SR), pp. 204–213.
- ICALP-1990-Razborov #complexity #on the
- On the Distributional Complexity of Disjontness (AAR), pp. 249–253.
- STOC-1989-Razborov #approximate #on the
- On the Method of Approximations (AAR), pp. 167–176.