Search results

  1. 1.
    0447653 - MÚ 2016 RIV DE eng M - Monography Chapter
    Paturi, R. - Pudlák, Pavel - Saks, M. - Zane, F.
    Backtracking based k-SAT algorithms.
    Encyclopedia of Algorithms. Berlin: Springer, 2015 - (Kao, M.), s. 1-6. ISBN 978-3-642-27848-8
    Institutional support: RVO:67985840
    Keywords : theory of computation * algorithms
    Subject RIV: BA - General Mathematics
    http://link.springer.com/referenceworkentry/10.1007/978-3-642-27848-8_45-2
    Permanent Link: http://hdl.handle.net/11104/0249436
    FileDownloadSizeCommentaryVersionAccess
    Pudlak.pdf1132.6 KBPublisher’s postprintrequire
     
  2. 2.
    0422148 - MÚ 2014 RIV US eng M - Monography Chapter
    Pudlák, Pavel
    Randomness, pseudorandomness and models of arithmetic.
    New Studies in Weak Arithmetics. 1. Stanford: Center for the Study of Language and Information, 2013 - (Cégielski, P.; Cornaros, C.; Dimitracopoulos, C.), s. 199-216. CSLI Lecture Notes, vol. 211. ISBN 978-1-57586-723-6
    R&D Projects: GA AV ČR IAA100190902
    Institutional support: RVO:67985840
    Keywords : pseudorandomness * number theory
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0228428
    FileDownloadSizeCommentaryVersionAccess
    Pudlak3.pdf15.9 MBPublisher’s postprintrequire
     
  3. 3.
    0174516 - MU-W 980024 RIV US eng M - Monography Chapter
    Pudlák, Pavel - Sgall, Jiří
    Algebraic models of computation and interpolation for algebraic proof systems.
    Proof Complexity and Feasible Arithmetic. New York: AMS, 1998 - (Buss, S.), s. 279-296. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 39
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0071522
    FileDownloadSizeCommentaryVersionAccess
    Pudlak.pdf1279.5 KBAuthor’s postprintopen-access
     
  4. 4.
    0174349 - MU-W 960173 RIV DE eng M - Monography Chapter
    Pudlák, Pavel - Sgall, Jiří
    An upper bound for a communication game related to space-time tradeoffs.
    Berlin: Springer, 1996. Algorithms and Combinatorics, 13. In: The Mathematics of Paul Erdös., s. 393-399
    R&D Projects: GA AV ČR IAA119107
    Grant - others:US-CZ Science and Technology Program 93025
    Source of funding: US
    Permanent Link: http://hdl.handle.net/11104/0071360
     
  5. 5.
    0174176 - MU-W 950127 RIV US eng M - Monography Chapter
    Krause, M. - Pudlák, Pavel
    On Computing boolean functions by sparse real polynomials.
    IEEE, 1995. In: Proceedings IEEE FOCS., s. 682-691
    R&D Projects: GA AV ČR IAA119107
    Permanent Link: http://hdl.handle.net/11104/0071190
    FileDownloadSizeCommentaryVersionAccess
    Pudlak2.pdf1840.9 KBPublisher’s postprintrequire
     
  6. 6.
    0174175 - MU-W 950126 RIV DE eng M - Monography Chapter
    Pudlák, Pavel - Buss, S.R.
    How to Lie without being (easily) convicted and the lengths of proofs in propositional calculas.
    Berlin: Springer, 1995. Lecture Notes in Computer Science, 933. ISBN 3-540-60017-5. In: Computer Science Logic '94., s. 151-162
    R&D Projects: GA AV ČR IAA119107
    Permanent Link: http://hdl.handle.net/11104/0071189
    FileDownloadSizeCommentaryVersionAccess
    Pudlak3.pdf1212.8 KBAuthor’s postprintrequire
     
  7. 7.
    0174113 - MU-W 950124 RIV US eng M - Monography Chapter
    Pudlák, Pavel
    Complexity theory and genetics.
    IEEE, 1994. In: Proceedings Structure in Complexity Theory., s. 383-395
    R&D Projects: GA AV ČR IAA119107
    Permanent Link: http://hdl.handle.net/11104/0071130
    FileDownloadSizeCommentaryVersionAccess
    Pudlak2.pdf11.1 MBPublisher’s postprintrequire
     
  8. 8.
    0041114 - MÚ 2007 RIV DE eng M - Monography Chapter
    Pudlák, Pavel
    On Explicit Ramsey Graphs and Estimates of the Number of Sums and Products.
    [O explicitních Ramseyovských grafech a odhadech na počet součtů a součinů.]
    Topics in Discrete Mathematics. Dedicated to Jarik Nešetřil on the Occasion of his 60th Birthday. Berlin: Springer, 2006 - (Klazar, M.; Kratochvíl, J.; Loebl, M.; Matoušek, J.; Thomas, R.; Valtr, P.), s. 169-175. Algorithms and Combinatorics, 26. ISBN 3-540-33698-2
    R&D Projects: GA AV ČR(CZ) IAA1019401
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : Ramsey graphs * explicit constructions
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0134688
    FileDownloadSizeCommentaryVersionAccess
    Pudlak1.pdf1152.4 KBAuthor’s postprintopen-access
     
  9. 9.
    0027278 - MÚ 2006 RIV RU eng M - Monography Chapter
    Paturi, R. - Pudlák, Pavel
    Circuit lower bounds and linear codes.
    [Dolní odhady na obvody a lineární kódy.]
    Notes of Mathematical Seminars of St. Petersburg Department of Steklov Institute of Mathematics. Vol. 316. St. Petersburg: Steklov Institute of Mathematics, 2004 - (Hirsch, E.), s. 188-204
    R&D Projects: GA AV ČR(CZ) IAA1019401
    Institutional research plan: CEZ:AV0Z1019905
    Keywords : linear codes * algebraic circuits
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0117394
    FileDownloadSizeCommentaryVersionAccess
    Pudlak.pdf11.5 MBAuthor’s postprintopen-access
     
  10. 10.
    0021599 - MÚ 2006 RIV IT eng M - Monography Chapter
    Pudlák, Pavel - Rödl, V.
    Pseudorandom sets and explicit constructions of Ramsey graphs.
    [Pseudonáhodné množiny a ramseyovské grafy.]
    Complexity of computations and proofs. Napoli: Dipartimento di Matematica della Seconda Universita di Napoli, 2004 - (Krajíček, J.), s. 327-346. Quaderni di matematica, 13. ISBN 88-7999-413-1
    R&D Projects: GA AV ČR(CZ) IAA1019401
    Institutional research plan: CEZ:AV0Z1019905
    Keywords : ramsey graphs * explicit constructions
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0110538
    FileDownloadSizeCommentaryVersionAccess
    Pudlak1.pdf1273.1 KBAuthor´s preprintopen-access