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
[1]
Hilfe
Suche: Author="Pudl{\'{a}}k, Pavel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
Anna Gál
,
Kristoffer Arnsfelt Hansen
,
Michal Koucký
,
Pavel Pudlák
,
Emanuele Viola
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 479-494
Pseudorandom generators for group products
Michal Koucký
,
Prajakta Nimbhorkar
,
Pavel Pudlák
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 263-272
Bounded-depth circuits: Separating wires from gates
Michal Koucký
,
Pavel Pudlák
,
Denis Thérien
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 257-265
An improved exponential-time algorithm for
k
-SAT
Ramamohan Paturi
,
Pavel Pudlák
,
Michael E. Saks
,
Francis Zane
Journal of the ACM
52
(3), 2005, pp. 337-364
Monotone simulations of non-monotone proofs
Albert Atserias
,
Nicola Galesi
,
Pavel Pudlák
Journal of Computer and System Sciences
65
(4), 2002, pp. 626-638
On reducibility and symmetry of disjoint
NP
-pairs
Pavel Pudlák
Lecture Notes in Computer Science
2136
, 2001, pp. 621-632
Monotone simulations of nonmonotone proofs
Albert Atserias
,
Nicola Galesi
,
Pavel Pudlák
Proceedings of the 16th Annual IEEE Conference on Computational Complexity (Chicago, Illinois, June 18-21, 2001)
, 2000, pp. 36-41
Some structural prosperties of low-rank matrices related to computational complexity
Bruno Codenotti
,
Pavel Pudlák
,
Giovanni Resta
Theoretical Computer Science
235
(1), 2000, pp. 89-107
A note on the use of determinant for proving lower bounds on the size of linear circuits
Pavel Pudlák
Information Processing Letters
74
(5-6), 2000, pp. 197-201
An improved exponential-time algorithm for
k
-SAT
Ramamohan Paturi
,
Pavel Pudlák
,
Michael E. Saks
,
Francis Zane
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 628-637
Satisfiability - Algorithms and logic
Pavel Pudlák
Lecture Notes in Computer Science
1450
, 1998, pp. 129-141
On the computational power of depth-2 circuits with threshold and modulo gates
Matthias Krause
,
Pavel Pudlák
Theoretical Computer Science
174
(1-2), 1997, pp. 137-156
Satisfiability coding lemma
Ramamohan Paturi
,
Pavel Pudlák
,
Francis Zane
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 566-574
On sparse parity check matrices
Hanno Lefmann
,
Pavel Pudlák
,
Petr Savický
Lecture Notes in Computer Science
1090
, 1996, pp. 41-49
Some consequences of cryptographical conjectures for
S_2^1
and EF
Jan Krajíc̑ek
,
Pavel Pudlák
Lecture Notes in Computer Science
960
, 1995, pp. 210-220
On computing Boolean functions by sparse real polynomials
Matthias Krause
,
Pavel Pudlák
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 682-691