Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[3]
Hilfe
Suche: Author="Razborov, Alexander A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the Caccetta-Häggkvist conjecture with forbidden subgraphs
Alexander A. Razborov
Journal of Graph Theory
74
(2), 2013, pp. 236-248
The sign-rank of AC
^0
Alexander A. Razborov
,
Alexander A. Sherstov
SIAM Journal on Computing
39
(5), 2010, pp. 1833-1855
On 3-hypergraphs with forbidden 4-vertex configurations
Alexander A. Razborov
SIAM Journal on Discrete Mathematics
24
(3), 2010, pp. 946-963
Resolution is not automatizable unless W[P] is tractable
Michael Alekhnovich
,
Alexander A. Razborov
SIAM Journal on Computing
38
(4), 2008, pp. 1347-1363
Pseudorandom generators in propositional proof complexity
Michael Alekhnovich
,
Eli Ben-Sasson
,
Alexander A. Razborov
,
Avi Wigderson
SIAM Journal on Computing
34
(1), 2004, pp. 67-88
Resolution lower bounds for perfect matching principles
Alexander A. Razborov
Journal of Computer and System Sciences
69
(1), 2004, pp. 3-27
Feasible proofs and computations: Partnership and fusion
Alexander A. Razborov
Lecture Notes in Computer Science
3142
, 2004, pp. 8-14
Resolution lower bounds for the weak functional pigeonhole principle
Alexander A. Razborov
Theoretical Computer Science
303
(1), 2003, pp. 233-243
Space complexity in propositional calculus
Michael Alekhnovich
,
Eli Ben-Sasson
,
Alexander A. Razborov
,
Avi Wigderson
SIAM Journal on Computing
31
(4), 2002, pp. 1184-1211
Satisfiability, branch-width and Tseitin tautologies
Michael Alekhnovich
,
Alexander A. Razborov
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 593-603
Space complexity in propositional calculus
Michael Alekhnovich
,
Eli Ben-Sasson
,
Alexander A. Razborov
,
Avi Wigderson
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 358-367
Space complexity in propositional calculus
Michael Alekhnovich
,
Eli Ben-Sasson
,
Alexander A. Razborov
,
Avi Wigderson
Technical Report (TR99-040), 1999
Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields
D. Grigoriev
,
Alexander A. Razborov
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 269-278
Natural proofs
Alexander A. Razborov
,
Steven Rudich
Journal of Computer and System Sciences
55
(1), 1997, pp. 24-35
Lower bounds for propositional proofs and independence results in bounded arithmetic
Alexander A. Razborov
Lecture Notes in Computer Science
1099
, 1996, pp. 48-62
Lower bounds for propositional proofs and independence results in bounded arithmetic
Alexander A. Razborov
Lecture Notes in Computer Science
969
, 1995, pp. 105-105
Natural proofs
Alexander A. Razborov
,
Steven Rudich
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 204-213
On the parameterization of solutions for equations in free groups
Alexander A. Razborov
International Journal of Algebra and Computation
3
(3), 1993, pp. 251-273
On small depth threshold circuits
Alexander A. Razborov
Lecture Notes in Computer Science
621
, 1992, pp. 42-52
Lower bounds for deterministic and nondeterministic branching programs
Alexander A. Razborov
Lecture Notes in Computer Science
529
, 1991, pp. 47-60