The SCEAS System
| |||||||

## Search the dblp DataBase
Alexander A. Razborov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Allan Borodin, Alexander A. Razborov, Roman Smolensky
**On Lower Bounds for Read-K-Times Branching Programs.**[Citation Graph (1, 0)][DBLP] Computational Complexity, 1993, v:3, n:, pp:1-18 [Journal] - Alexander A. Razborov, Steven Rudich
**Natural Proofs.**[Citation Graph (1, 0)][DBLP] J. Comput. Syst. Sci., 1997, v:55, n:1, pp:24-35 [Journal] - Mikael Goldmann, Johan Håstad, Alexander A. Razborov
**Majority Gates vs. General Weighted Threshold Gates.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:2-13 [Conf] - Alexander A. Razborov
**Resolution Lower Bounds for Perfect Matching Principles.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:29-38 [Conf] - Erich Grädel, Janos Makowsky, Alexander A. Razborov
**The Ackermann Award 2005.**[Citation Graph (0, 0)][DBLP] CSL, 2005, pp:557-565 [Conf] - Alexander A. Razborov
**Proof Complexity of Pigeonhole Principles.**[Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2001, pp:100-116 [Conf] - Alexander A. Razborov
**Lower Bounds for Deterministic and Nondeterministic Branching Programs.**[Citation Graph (0, 0)][DBLP] FCT, 1991, pp:47-60 [Conf] - Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
**Pseudorandom Generators in Propositional Proof Complexity.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:43-53 [Conf] - Michael Alekhnovich, Alexander A. Razborov
**Lower Bounds for Polynomial Calculus: Non-Binomial Case.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:190-199 [Conf] - Michael Alekhnovich, Alexander A. Razborov
**Resolution is Not Automatizable Unless W[P] is Tractable.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:210-219 [Conf] - Michael Alekhnovich, Alexander A. Razborov
**Satisfiability, Branch-Width and Tseitin Tautologies.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:593-603 [Conf] - Dima Grigoriev, Alexander A. Razborov
**Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:269-278 [Conf] - Alexander A. Razborov, Sergey Yekhanin
**An Omega(n**[Citation Graph (0, 0)][DBLP]^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval. FOCS, 2006, pp:739-748 [Conf] - Alexander A. Razborov
**Feasible Proofs and Computations: Partnership and Fusion.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:8-14 [Conf] - Alexander A. Razborov
**On the Distributional Complexity of Disjontness.**[Citation Graph (0, 0)][DBLP] ICALP, 1990, pp:249-253 [Conf] - Alexander A. Razborov
**Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic.**[Citation Graph (0, 0)][DBLP] ICALP, 1996, pp:48-62 [Conf] - Alexander A. Razborov
**Feasible Proofs and Computations: Partnership and Fusion.**[Citation Graph (0, 0)][DBLP] LICS, 2004, pp:134-138 [Conf] - Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
**On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.**[Citation Graph (0, 0)][DBLP] MFCS, 1997, pp:319-326 [Conf] - Alexander A. Razborov
**Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (Abstract).**[Citation Graph (0, 0)][DBLP] MFCS, 1995, pp:105- [Conf] - Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
**Space complexity in propositional calculus.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:358-367 [Conf] - Alexander A. Razborov
**On the Method of Approximations**[Citation Graph (0, 0)][DBLP] STOC, 1989, pp:167-176 [Conf] - Alexander A. Razborov, Steven Rudich
**Natural proofs.**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:204-213 [Conf] - Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao
**Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus.**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:739-748 [Conf] - Alexander A. Razborov
**On Small Depth Threshold Circuits.**[Citation Graph (0, 0)][DBLP] SWAT, 1992, pp:42-52 [Conf] - Dima Grigoriev, Alexander A. Razborov
**Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields.**[Citation Graph (0, 0)][DBLP] Appl. Algebra Eng. Commun. Comput., 2000, v:10, n:6, pp:465-487 [Journal] - Samuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jiri Sgall
**Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1997, v:6, n:3, pp:256-298 [Journal] - Mikael Goldmann, Johan Håstad, Alexander A. Razborov
**Majority Gates VS. General Weighted Threshold Gates.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1992, v:2, n:, pp:277-300 [Journal] - Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
**On P versus NP cap co-NP for decision trees and read-once branching programs.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1999, v:8, n:4, pp:357-370 [Journal] - Alexander A. Razborov
**Lower Bounds for the Polynomial Calculus.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1998, v:7, n:4, pp:291-324 [Journal] - Alexander A. Razborov
**Applications of matrix methods to the theory of lower bounds in computational complexity.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1990, v:10, n:1, pp:81-93 [Journal] - Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao
**Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2002, v:22, n:4, pp:555-574 [Journal] - Alexander A. Razborov, Endre Szemerédi, Avi Wigderson
**Constructing Small Sets that are Uniform in Arithmetic Progressions.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:513-518 [Journal] - Stasys Jukna, Alexander A. Razborov
**Neither Reading Few Bits Twice Nor Reading Illegally Helps Much.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:85, n:3, pp:223-238 [Journal] - Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
**Pseudorandom Generators in Propositional Proof Complexity**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:23, pp:- [Journal] - Alexander A. Razborov
**Improved Resolution Lower Bounds for the Weak Pigeonhole Principle**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:55, pp:- [Journal] - Alexander A. Razborov
**Resolution Lower Bounds for the Weak Functional Pigeonhole Principle**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:075, pp:- [Journal] - Alexander A. Razborov
**On provably disjoint NP-pairs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:6, pp:- [Journal] - Alexander A. Razborov, Steven Rudich
**Natural Proofs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:10, pp:- [Journal] - Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
**On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:23, pp:- [Journal] - Alexander A. Razborov, Nikolai K. Vereshchagin
**One Property of Cross-Intersecting Families**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:14, pp:- [Journal] - Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
**Space Complexity in Propositional Calculus**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:40, pp:- [Journal] - Alexander A. Razborov, Avi Wigderson
**n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:45, n:6, pp:303-307 [Journal] - Alexander A. Razborov
**Propositional proof complexity.**[Citation Graph (0, 0)][DBLP] J. ACM, 2003, v:50, n:1, pp:80-82 [Journal] - Mike Paterson, Alexander A. Razborov
**The Set of Minimal Braids is co-NP-Complete.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1991, v:12, n:3, pp:393-408 [Journal] - Alexander A. Razborov
**Resolution lower bounds for perfect matching principles.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:1, pp:3-27 [Journal] - Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
**Space Complexity in Propositional Calculus.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:4, pp:1184-1211 [Journal] - Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
**Pseudorandom Generators in Propositional Proof Complexity.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:34, n:1, pp:67-88 [Journal] - Johan Håstad, Alexander A. Razborov, Andrew Chi-Chih Yao
**On the Shrinkage Exponent for Read-Once Formulae.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:141, n:1&2, pp:269-282 [Journal] - Alexander A. Razborov
**Resolution lower bounds for the weak functional pigeonhole principle.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:303, pp:233-243 [Journal] - Alexander A. Razborov
**On the Distributional Complexity of Disjointness.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1992, v:106, n:2, pp:385-390 [Journal] - Vladimir Lifschitz, Alexander A. Razborov
**Why are there so many loop formulas?**[Citation Graph (0, 0)][DBLP] ACM Trans. Comput. Log., 2006, v:7, n:2, pp:261-268 [Journal] - Alexander A. Razborov
**The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:108, n:1-3, pp:393-396 [Journal] **The Ackermann Award 2009.**[Citation Graph (, )][DBLP]**Complexity of Propositional Proofs.**[Citation Graph (, )][DBLP]**The Sign-Rank of AC^O.**[Citation Graph (, )][DBLP]**Almost Euclidean subspaces of l**[Citation Graph (, )][DBLP]^{N}_{1}via expander codes.**On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution**[Citation Graph (, )][DBLP]**On the Minimal Density of Triangles in Graphs.**[Citation Graph (, )][DBLP]**A simple proof of Bazzi's theorem.**[Citation Graph (, )][DBLP]**The Sign-Rank of AC^0.**[Citation Graph (, )][DBLP]**Almost Euclidean subspaces of $\ell_1^N$ via expander codes.**[Citation Graph (, )][DBLP]**An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.008secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |