The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Krajícek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jan Krajícek
    Proof Complexity Generators. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:3- [Conf]
  2. Jan Krajícek
    Forcing with Random Variables and Proof Complexity. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:277-278 [Conf]
  3. Jan Krajícek, Pavel Pudlák
    Propositional Provability and Models of Weak Arithmetic. [Citation Graph (0, 0)][DBLP]
    CSL, 1989, pp:193-210 [Conf]
  4. Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák
    Lower Bound on Hilbert's Nullstellensatz and propositional proofs [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:794-806 [Conf]
  5. Jan Krajícek, Pavel Pudlák
    Some Consequences of Cryptographical Conjectures for S_2^1 and EF. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:210-220 [Conf]
  6. Jan Krajícek
    Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial Calculus. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:85-90 [Conf]
  7. Jan Krajícek, Pavel Pudlák, Jiri Sgall
    Interactive Computations of Optimal Solutions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:48-60 [Conf]
  8. Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods
    Exponential Lower Bounds for the Pigeonhole Principle [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:200-220 [Conf]
  9. Jan Krajícek, Gaisi Takeuti
    On Induction-Free Provability. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1992, v:6, n:1-3, pp:107-125 [Journal]
  10. Jan Krajícek
    Combinatorics of first order structures and propositional proof systems. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2004, v:43, n:4, pp:427-441 [Journal]
  11. Jan Krajícek
    Hardness assumptions in the foundations of theoretical computer science. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2005, v:44, n:6, pp:667-675 [Journal]
  12. Jan Krajícek
    On the Number of Steps in Proofs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:41, n:2, pp:153-178 [Journal]
  13. Jan Krajícek
    Exponentiation and Second-Order Bounded Arithmetic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:48, n:3, pp:261-276 [Journal]
  14. Jan Krajícek, Pavel Pudlák, Gaisi Takeuti
    Bounded Arithmetic and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:52, n:1-2, pp:143-153 [Journal]
  15. Jan Krajícek
    Tautologies from pseudo-random generators. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2001, v:7, n:2, pp:197-212 [Journal]
  16. Jan Krajícek, Thomas Scanlon
    Combinatorics with definable sets: Euler characteristics and Grothendieck rings. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2000, v:3, n:3, pp:311-330 [Journal]
  17. 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]
  18. Jan Krajícek
    Tautologies from pseudo-random generators [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:33, pp:- [Journal]
  19. Jan Krajícek
    Implicit proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:055, pp:- [Journal]
  20. Jan Krajícek
    Diagonalization in proof complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:018, pp:- [Journal]
  21. Jan Krajícek, Pavel Pudlák, Alan R. Woods
    An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:18, pp:- [Journal]
  22. Jan Krajícek
    Interpolation by a Game [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:15, pp:- [Journal]
  23. Jan Krajícek, Pavel Pudlák
    Some Consequences of Cryptographical Conjectures for S12 and EF. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:1, pp:82-94 [Journal]
  24. Jan Krajícek
    Dehn Function and Length of Proofs. [Citation Graph (0, 0)][DBLP]
    IJAC, 2003, v:13, n:5, pp:527-541 [Journal]
  25. Jan Krajícek
    Substitutions into propositional tautologies. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:4, pp:163-167 [Journal]
  26. Mario Chiari, Jan Krajícek
    Witnessing Functions in Bounded Arithmetic and Search Problems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:3, pp:1095-1115 [Journal]
  27. Jan Krajícek
    Lower Bounds to the Size of Constant-Depth Propositional Proofs. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1994, v:59, n:1, pp:73-86 [Journal]
  28. Jan Krajícek
    Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:2, pp:457-486 [Journal]
  29. Jan Krajícek
    Discretely Ordered Modules as a First-Order Extension of The Cutting Planes Proof System. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:4, pp:1582-1596 [Journal]
  30. Jan Krajícek, Pavel Pudlák
    Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:3, pp:1063-1079 [Journal]
  31. Russell Impagliazzo, Jan Krajícek
    A Note on Conservativity Relations among Bounded Arithmetic Theories. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:3, pp:375-377 [Journal]
  32. Jan Krajícek
    Interpolation and Approximate Semantic Derivations. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:4, pp:602-606 [Journal]
  33. Jan Krajícek
    Interpolation by a Game. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:450-458 [Journal]
  34. Jan Krajícek, Pavel Pudlák, Alan R. Woods
    An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:7, n:1, pp:15-40 [Journal]
  35. Matthias Baaz, Petr Hájek, David Svejda, Jan Krajícek
    Embedding Logics into Product Logic. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1998, v:61, n:1, pp:35-47 [Journal]

  36. From Feasible Proofs to Feasible Computations. [Citation Graph (, )][DBLP]


  37. Lifting independence results in bounded arithmetic. [Citation Graph (, )][DBLP]


  38. An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams. [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002