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
Hilfe
Suche: Author="Pudl{\'a}k, Pavel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partition expanders
Dmitry Gavinsky
,
Pavel Pudlák
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 325-336
Parity games and propositional proofs
Arnold Beckmann
,
Pavel Pudlák
,
Neil Thapen
Lecture Notes in Computer Science
8087
, 2013, pp. 111-122
The complexity of proving that a graph is Ramsey
Massimo Lauria
,
Pavel Pudlák
,
Vojtȇch Rödl
,
Neil Thapen
Lecture Notes in Computer Science
7965
, 2013, pp. 684-695
A lower bound on the size of resolution proofs of the Ramsey theorem
Pavel Pudlák
Information Processing Letters
112
(14-15), 2012, pp. 610-611
Some constructive bounds on Ramsey numbers
Alexandr Kostochka
,
Pavel Pudlák
,
Vojtech Rödl
Journal of Combinatorial Theory Series B
100
(5), 2010, pp. 439-445
On the complexity of circuit satisfiability
Ramamohan Paturi
,
Pavel Pudlák
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 241-249
On extracting computations from propositional proofs (a survey)
Pavel Pudlák
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 30-41
On search problems in complexity theory and in logic
Pavel Pudlák
Lecture Notes in Computer Science
3998
, 2006, pp. 5-5
A note on monotone complexity and the rank of matrices
Anna Gál
,
Pavel Pudlák
Information Processing Letters
87
(6), 2003, pp. 321-326
Erratum to ''A note on monotone complexity and the rank of matrices''
Anna Gál
,
Pavel Pudlák
Information Processing Letters
88
(5), 2003, pp. 257-257
On reducibility and symmetry of disjoint
NP
pairs
Pavel Pudlák
Theoretical Computer Science
295
(1-3), 2003, pp. 323-339
Cycles of nonzero elements in low rank matrices
Pavel Pudlák
Combinatorica
22
(2), 2002, pp. 321-334
Some consequences of cryptographical conjectures for
S_2^1
and EF
Jan Krajíc̑ek
,
Pavel Pudlák
Information and Computation
140
(1), 1998, pp. 82-94
A note on the use of determinant for proving lower bounds on the size of linear circuits
Pavel Pudlák
Technical Report (TR98-042), 1998
Lower bounds for the polynomial calculus and the Groebner basis algorithm
Russell Impagliazzo
,
Pavel Pudlák
,
Jiȓí Sgall
Technical Report (TR97-042), 1997, September
Boolean circuits, tensor ranks, and communication complexity
Pavel Pudlák
,
Vojtȇch Rödl
,
Jiȓí Sgall
SIAM Journal on Computing
26
(3), 1997, pp. 605-633
Lower bounds for resolution and cutting planes proofs and monotone computations
Pavel Pudlák
misc, 1995, September
Lower bounds on Hilbert's Nullstellensatz and propositional proofs
Paul Beame
,
Russell Impagliazzo
,
Jan Krajíc̑ek
,
Toniann Pitassi
,
Pavel Pudlák
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 794-806
On the computational power of depth 2 circuits with threshold and modulo gates
Matthias Krause
,
Pavel Pudlák
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 48-57
Unexpected upper bounds on the complexity of some communication games
Pavel Pudlák
Lecture Notes in Computer Science
820
, 1994, pp. 1-10
Threshold circuits of bounded depth
András Hajnal
,
Wolfgang Maass
,
Pavel Pudlák
,
Márió Szegedy
,
György Turán
Journal of Computer and System Sciences
46
(2), 1993, pp. 129-154
On shifting networks
Pavel Pudlák
,
Petr Savický
Theoretical Computer Science
116
(2), 1993, pp. 415-419
Exponential lower bounds for the pigeonhole principle
Paul Beame
,
Russell Impagliazzo
,
Jan Krajíc̑ek
,
Toniann Pitassi
,
Pavel Pudlák
,
Alan Woods
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 200-220
Graph complexity
Pavel Pudlák
,
Vojtȇch Rödl
,
Petr Savický
Acta Informatica
25
, 1988, pp. 515-535
New lower bound for polyhedral membership problem with an application to linear programming
Jaroslav Morávek
,
Pavel Pudlák
Lecture Notes in Computer Science
176
, 1984, pp. 416-424
Seiten 1
2
>