default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jan Krajícek
@article{DBLP:journals/bsl/Krajicek24,
author = {Jan Kraj{\'{\i}}cek},
title = {On the existence of Strong Proof Complexity Generators},
journal = {Bull. Symb. Log.},
volume = {30},
number = {1},
pages = {20--40},
year = {2024},
url = {https://doi.org/10.1017/bsl.2023.40},
doi = {10.1017/BSL.2023.40},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bsl/Krajicek24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/acm/23/Krajicek23,
author = {Jan Kraj{\'{\i}}cek},
editor = {Bruce M. Kapron},
title = {The Cook-Reckhow Definition},
booktitle = {Logic, Automata, and Computational Complexity: The Works of Stephen
A. Cook},
series = {{ACM} Books},
volume = {43},
pages = {83--94},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3588287.3588293},
doi = {10.1145/3588287.3588293},
timestamp = {Thu, 21 Sep 2023 14:31:10 +0200},
biburl = {https://dblp.org/rec/books/acm/23/Krajicek23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-10617,
author = {Jan Kraj{\'{\i}}cek},
title = {Extended Nullstellensatz proof systems},
journal = {CoRR},
volume = {abs/2301.10617},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.10617},
doi = {10.48550/ARXIV.2301.10617},
eprinttype = {arXiv},
eprint = {2301.10617},
timestamp = {Fri, 27 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-10617.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-10637,
author = {Jan Kraj{\'{\i}}cek},
title = {A proof complexity conjecture and the Incompleteness theorem},
journal = {CoRR},
volume = {abs/2303.10637},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.10637},
doi = {10.48550/ARXIV.2303.10637},
eprinttype = {arXiv},
eprint = {2303.10637},
timestamp = {Wed, 22 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-10637.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Krajicek23,
author = {Jan Kraj{\'{\i}}cek},
title = {Extended Nullstellensatz proof systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-007}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/007},
eprinttype = {ECCC},
eprint = {TR23-007},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/Krajicek23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Krajicek23a,
author = {Jan Kraj{\'{\i}}cek},
title = {A proof complexity conjecture and the Incompleteness theorem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-030}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/030},
eprinttype = {ECCC},
eprint = {TR23-030},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Krajicek23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek22,
author = {Jan Kraj{\'{\i}}cek},
title = {Information in Propositional Proofs and Algorithmic Proof Search},
journal = {J. Symb. Log.},
volume = {87},
number = {2},
pages = {852--869},
year = {2022},
url = {https://doi.org/10.1017/jsl.2021.75},
doi = {10.1017/JSL.2021.75},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-11642,
author = {Jan Kraj{\'{\i}}cek},
title = {On the existence of strong proof complexity generators},
journal = {CoRR},
volume = {abs/2208.11642},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.11642},
doi = {10.48550/ARXIV.2208.11642},
eprinttype = {arXiv},
eprint = {2208.11642},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-11642.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Krajicek22,
author = {Jan Kraj{\'{\i}}cek},
title = {On the existence of strong proof complexity generators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-120}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/120},
eprinttype = {ECCC},
eprint = {TR22-120},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Krajicek22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/Krajicek21,
author = {Jan Kraj{\'{\i}}cek},
title = {Small Circuits and Dual Weak {PHP} in the Universal Theory of p-time
Algorithms},
journal = {{ACM} Trans. Comput. Log.},
volume = {22},
number = {2},
pages = {11:1--11:4},
year = {2021},
url = {https://doi.org/10.1145/3446207},
doi = {10.1145/3446207},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/Krajicek21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-04711,
author = {Jan Kraj{\'{\i}}cek},
title = {Information in propositional proofs and algorithmic proof search},
journal = {CoRR},
volume = {abs/2104.04711},
year = {2021},
url = {https://arxiv.org/abs/2104.04711},
eprinttype = {arXiv},
eprint = {2104.04711},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-04711.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Krajicek21,
author = {Jan Kraj{\'{\i}}cek},
title = {Information in propositional proofs and algorithmic proof search},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-053}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/053},
eprinttype = {ECCC},
eprint = {TR21-053},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Krajicek21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BydzovskyKO20,
author = {Jan Bydzovsky and
Jan Kraj{\'{\i}}cek and
Igor C. Oliveira},
title = {Consistency of circuit lower bounds with bounded theories},
journal = {Log. Methods Comput. Sci.},
volume = {16},
number = {2},
year = {2020},
url = {https://doi.org/10.23638/LMCS-16(2:12)2020},
doi = {10.23638/LMCS-16(2:12)2020},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/BydzovskyKO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/Krajicek20,
author = {Jan Kraj{\'{\i}}cek},
title = {A limitation on the {KPT} interpolation},
journal = {Log. Methods Comput. Sci.},
volume = {16},
number = {3},
year = {2020},
url = {https://lmcs.episciences.org/6708},
timestamp = {Wed, 19 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/Krajicek20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-02448,
author = {Jan Kraj{\'{\i}}cek},
title = {A limitation on the {KPT} interpolation},
journal = {CoRR},
volume = {abs/2004.02448},
year = {2020},
url = {https://arxiv.org/abs/2004.02448},
eprinttype = {arXiv},
eprint = {2004.02448},
timestamp = {Wed, 08 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-02448.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-11582,
author = {Jan Kraj{\'{\i}}cek},
title = {Small circuits and dual weak {PHP} in the universal theory of p-time
algorithms},
journal = {CoRR},
volume = {abs/2004.11582},
year = {2020},
url = {https://arxiv.org/abs/2004.11582},
eprinttype = {arXiv},
eprint = {2004.11582},
timestamp = {Wed, 29 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-11582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-12935,
author = {Jan Bydzovsky and
Jan Kraj{\'{\i}}cek and
Igor C. Oliveira},
title = {Consistency of circuit lower bounds with bounded theories},
journal = {CoRR},
volume = {abs/1905.12935},
year = {2019},
url = {http://arxiv.org/abs/1905.12935},
eprinttype = {arXiv},
eprint = {1905.12935},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-12935.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-03691,
author = {Jan Kraj{\'{\i}}cek},
title = {The Cook-Reckhow definition},
journal = {CoRR},
volume = {abs/1909.03691},
year = {2019},
url = {http://arxiv.org/abs/1909.03691},
eprinttype = {arXiv},
eprint = {1909.03691},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-03691.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BydzovskyOK19,
author = {Jan Bydzovsky and
Igor Carboni Oliveira and
Jan Kraj{\'{\i}}cek},
title = {Consistency of circuit lower bounds with bounded theories},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-077}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/077},
eprinttype = {ECCC},
eprint = {TR19-077},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BydzovskyOK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/KrajicekO18,
author = {Jan Kraj{\'{\i}}cek and
Igor C. Oliveira},
title = {On monotone circuits with local oracles and clique lower bounds},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2018},
year = {2018},
url = {http://cjtcs.cs.uchicago.edu/articles/2018/1/contents.html},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cjtcs/KrajicekO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jml/Krajicek18,
author = {Jan Kraj{\'{\i}}cek},
title = {Randomized feasible interpolation and monotone circuits with a local
oracle},
journal = {J. Math. Log.},
volume = {18},
number = {2},
pages = {1850012:1--1850012:27},
year = {2018},
url = {https://doi.org/10.1142/S0219061318500125},
doi = {10.1142/S0219061318500125},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jml/Krajicek18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Krajicek16,
author = {Jan Kraj{\'{\i}}cek},
title = {A feasible interpolation for random resolution},
journal = {Log. Methods Comput. Sci.},
volume = {13},
number = {1},
year = {2017},
url = {https://doi.org/10.23638/LMCS-13(1:5)2017},
doi = {10.23638/LMCS-13(1:5)2017},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Krajicek16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KrajicekO16,
author = {Jan Kraj{\'{\i}}cek and
Igor C. Oliveira},
title = {Unprovability of circuit upper bounds in Cook's theory {PV}},
journal = {Log. Methods Comput. Sci.},
volume = {13},
number = {1},
year = {2017},
url = {https://doi.org/10.23638/LMCS-13(1:4)2017},
doi = {10.23638/LMCS-13(1:4)2017},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KrajicekO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KrajicekO17,
author = {Jan Kraj{\'{\i}}cek and
Igor C. Oliveira},
title = {On monotone circuits with local oracles and clique lower bounds},
journal = {CoRR},
volume = {abs/1704.06241},
year = {2017},
url = {http://arxiv.org/abs/1704.06241},
eprinttype = {arXiv},
eprint = {1704.06241},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KrajicekO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Krajicek16a,
author = {Jan Kraj{\'{\i}}cek},
title = {Randomized feasible interpolation and monotone circuits with a local
oracle},
journal = {CoRR},
volume = {abs/1611.08680},
year = {2016},
url = {http://arxiv.org/abs/1611.08680},
eprinttype = {arXiv},
eprint = {1611.08680},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Krajicek16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KrajicekO16,
author = {Jan Kraj{\'{\i}}cek and
Igor Carboni Oliveira},
title = {Unprovability of circuit upper bounds in Cook's theory {PV}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-071}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/071},
eprinttype = {ECCC},
eprint = {TR16-071},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KrajicekO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Krajicek15,
author = {Jan Kraj{\'{\i}}cek},
title = {Expansions of pseudofinite structures and circuit and proof complexity},
journal = {CoRR},
volume = {abs/1505.00118},
year = {2015},
url = {http://arxiv.org/abs/1505.00118},
eprinttype = {arXiv},
eprint = {1505.00118},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Krajicek15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Krajicek15a,
author = {Jan Kraj{\'{\i}}cek},
title = {Consistency of circuit evaluation, extended resolution and total {NP}
search problems},
journal = {CoRR},
volume = {abs/1509.03048},
year = {2015},
url = {http://arxiv.org/abs/1509.03048},
eprinttype = {arXiv},
eprint = {1509.03048},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Krajicek15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BeyersdorffHKS14,
author = {Olaf Beyersdorff and
Edward A. Hirsch and
Jan Kraj{\'{\i}}cek and
Rahul Santhanam},
title = {Optimal algorithms and proofs (Dagstuhl Seminar 14421)},
journal = {Dagstuhl Reports},
volume = {4},
number = {10},
pages = {51--68},
year = {2014},
url = {https://doi.org/10.4230/DagRep.4.10.51},
doi = {10.4230/DAGREP.4.10.51},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BeyersdorffHKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Krajicek13,
author = {Jan Kraj{\'{\i}}cek},
title = {A saturation property of structures obtained by forcing with a compact
family of random variables},
journal = {Arch. Math. Log.},
volume = {52},
number = {1-2},
pages = {19--28},
year = {2013},
url = {https://doi.org/10.1007/s00153-012-0304-9},
doi = {10.1007/S00153-012-0304-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Krajicek13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Krajicek13,
author = {Jan Kraj{\'{\i}}cek},
title = {A reduction of proof complexity to computational complexity for {\textdollar}AC{\^{}}0[p]{\textdollar}
Frege systems},
journal = {CoRR},
volume = {abs/1311.2501},
year = {2013},
url = {http://arxiv.org/abs/1311.2501},
eprinttype = {arXiv},
eprint = {1311.2501},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Krajicek13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Krajicek13,
author = {Jan Kraj{\'{\i}}cek},
title = {A reduction of proof complexity to computational complexity for AC\({}^{\mbox{0}}\)[p]
Frege systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-156}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/156},
eprinttype = {ECCC},
eprint = {TR13-156},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Krajicek13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0393,
author = {Jan Kraj{\'{\i}}cek},
title = {Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson
generator},
journal = {Log. Methods Comput. Sci.},
volume = {8},
number = {3},
year = {2012},
url = {https://doi.org/10.2168/LMCS-8(3:9)2012},
doi = {10.2168/LMCS-8(3:9)2012},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-0393.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Krajicek12,
author = {Jan Kraj{\'{\i}}cek},
title = {A note on {SAT} algorithms and proof complexity},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {490--493},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.009},
doi = {10.1016/J.IPL.2012.03.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Krajicek12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-1789,
author = {Jan Kraj{\'{\i}}cek},
title = {On the computational complexity of finding hard tautologies},
journal = {CoRR},
volume = {abs/1212.1789},
year = {2012},
url = {http://arxiv.org/abs/1212.1789},
eprinttype = {arXiv},
eprint = {1212.1789},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-1789.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0033749,
author = {Jan Kraj{\'{\i}}cek},
title = {Forcing with Random Variables and Proof Complexity},
series = {London Mathematical Society lecture note series},
volume = {382},
publisher = {Cambridge University Press},
year = {2011},
url = {http://www.cambridge.org/de/academic/subjects/mathematics/logic-categories-and-sets/forcing-random-variables-and-proof-complexity?format=PB},
isbn = {978-0-521-15433-8},
timestamp = {Mon, 01 Sep 2014 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0033749.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Krajicek11,
author = {Jan Kraj{\'{\i}}cek},
title = {A note on propositional proof complexity of some Ramsey-type statements},
journal = {Arch. Math. Log.},
volume = {50},
number = {1-2},
pages = {245--255},
year = {2011},
url = {https://doi.org/10.1007/s00153-010-0212-9},
doi = {10.1007/S00153-010-0212-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Krajicek11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jml/Krajicek11,
author = {Jan Kraj{\'{\i}}cek},
title = {On the Proof Complexity of the Nisan-Wigderson Generator based on
a Hard {NP} {\(\cap\)} coNP function},
journal = {J. Math. Log.},
volume = {11},
number = {1},
year = {2011},
url = {https://doi.org/10.1142/S0219061311000979},
doi = {10.1142/S0219061311000979},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jml/Krajicek11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek10,
author = {Jan Kraj{\'{\i}}cek},
title = {A form of feasible interpolation for constant depth Frege systems},
journal = {J. Symb. Log.},
volume = {75},
number = {2},
pages = {774--784},
year = {2010},
url = {https://doi.org/10.2178/jsl/1268917504},
doi = {10.2178/JSL/1268917504},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Krajicek10,
author = {Jan Kraj{\'{\i}}cek},
editor = {Anuj Dawar and
Helmut Veith},
title = {From Feasible Proofs to Feasible Computations},
booktitle = {Computer Science Logic, 24th International Workshop, {CSL} 2010, 19th
Annual Conference of the EACSL, Brno, Czech Republic, August 23-27,
2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6247},
pages = {22--31},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15205-4\_3},
doi = {10.1007/978-3-642-15205-4\_3},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Krajicek10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Krajicek10,
author = {Jan Kraj{\'{\i}}cek},
title = {On the proof complexity of the Nisan-Wigderson generator based on
a hard {NP} cap coNP function},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-054}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/054},
eprinttype = {ECCC},
eprint = {TR10-054},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Krajicek10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek08,
author = {Jan Kraj{\'{\i}}cek},
title = {An exponential lower bound for a constraint propagation proof system
based on ordered binary decision diagrams},
journal = {J. Symb. Log.},
volume = {73},
number = {1},
pages = {227--237},
year = {2008},
url = {https://doi.org/10.2178/jsl/1208358751},
doi = {10.2178/JSL/1208358751},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Krajicek07,
author = {Jan Kraj{\'{\i}}cek},
title = {Substitutions into propositional tautologies},
journal = {Inf. Process. Lett.},
volume = {101},
number = {4},
pages = {163--167},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2006.09.002},
doi = {10.1016/J.IPL.2006.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Krajicek07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/KrajicekST07,
author = {Jan Kraj{\'{\i}}cek and
Alan Skelley and
Neil Thapen},
title = {{NP} search problems in low fragments of bounded arithmetic},
journal = {J. Symb. Log.},
volume = {72},
number = {2},
pages = {649--672},
year = {2007},
url = {https://doi.org/10.2178/jsl/1185803628},
doi = {10.2178/JSL/1185803628},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/KrajicekST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/CookK07,
author = {Stephen A. Cook and
Jan Kraj{\'{\i}}cek},
title = {Consequences of the provability of \emph{NP} {\(\subseteq\)} \emph{P/poly}},
journal = {J. Symb. Log.},
volume = {72},
number = {4},
pages = {1353--1371},
year = {2007},
url = {https://doi.org/10.2178/jsl/1203350791},
doi = {10.2178/JSL/1203350791},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/CookK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Krajicek07,
author = {Jan Kraj{\'{\i}}cek},
title = {An exponential lower bound for a constraint propagation proof system
based on ordered binary decision diagrams},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-007}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-007/index.html},
eprinttype = {ECCC},
eprint = {TR07-007},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Krajicek07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Krajicek06,
author = {Jan Kraj{\'{\i}}cek},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Proof Complexity Generators},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {3},
publisher = {King's College, London},
year = {2006},
timestamp = {Tue, 24 Jul 2007 20:35:24 +0200},
biburl = {https://dblp.org/rec/conf/acid/Krajicek06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Krajicek06,
author = {Jan Kraj{\'{\i}}cek},
editor = {Arnold Beckmann and
Ulrich Berger and
Benedikt L{\"{o}}we and
John V. Tucker},
title = {Forcing with Random Variables and Proof Complexity},
booktitle = {Logical Approaches to Computational Barriers, Second Conference on
Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3988},
pages = {277--278},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780342\_29},
doi = {10.1007/11780342\_29},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/Krajicek06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Krajicek05,
author = {Jan Kraj{\'{\i}}cek},
title = {Hardness assumptions in the foundations of theoretical computer science},
journal = {Arch. Math. Log.},
volume = {44},
number = {6},
pages = {667--675},
year = {2005},
url = {https://doi.org/10.1007/s00153-005-0279-x},
doi = {10.1007/S00153-005-0279-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Krajicek05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek05,
author = {Jan Kraj{\'{\i}}cek},
title = {Structured pigeonhole principle, search problems and hard tautologies},
journal = {J. Symb. Log.},
volume = {70},
number = {2},
pages = {619--630},
year = {2005},
url = {https://doi.org/10.2178/jsl/1120224731},
doi = {10.2178/JSL/1120224731},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Krajicek04,
author = {Jan Kraj{\'{\i}}cek},
title = {Combinatorics of first order structures and propositional proof systems},
journal = {Arch. Math. Log.},
volume = {43},
number = {4},
pages = {427--441},
year = {2004},
url = {https://doi.org/10.1007/s00153-003-0186-y},
doi = {10.1007/S00153-003-0186-Y},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Krajicek04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek04,
author = {Jan Kraj{\'{\i}}cek},
title = {Approximate Euler characteristic, dimension, and weak pigeonhole principles},
journal = {J. Symb. Log.},
volume = {69},
number = {1},
pages = {201--214},
year = {2004},
url = {https://doi.org/10.2178/jsl/1080938837},
doi = {10.2178/JSL/1080938837},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek04a,
author = {Jan Kraj{\'{\i}}cek},
title = {Dual weak pigeonhole principle, pseudo-surjective functions, and provability
of circuit lower bounds},
journal = {J. Symb. Log.},
volume = {69},
number = {1},
pages = {265--286},
year = {2004},
url = {https://doi.org/10.2178/jsl/1080938841},
doi = {10.2178/JSL/1080938841},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek04b,
author = {Jan Kraj{\'{\i}}cek},
title = {Implicit proofs},
journal = {J. Symb. Log.},
volume = {69},
number = {2},
pages = {387--397},
year = {2004},
url = {https://doi.org/10.2178/jsl/1082418532},
doi = {10.2178/JSL/1082418532},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek04b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-018,
author = {Jan Kraj{\'{\i}}cek},
title = {Diagonalization in proof complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-018}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-018/index.html},
eprinttype = {ECCC},
eprint = {TR04-018},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/Krajicek03,
author = {Jan Kraj{\'{\i}}cek},
title = {Dehn Function and Length of Proofs},
journal = {Int. J. Algebra Comput.},
volume = {13},
number = {5},
pages = {527--541},
year = {2003},
url = {https://doi.org/10.1142/S0218196703001523},
doi = {10.1142/S0218196703001523},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijac/Krajicek03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-055,
author = {Jan Kraj{\'{\i}}cek},
title = {Implicit proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-055}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-055/index.html},
eprinttype = {ECCC},
eprint = {TR03-055},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/ImpagliazzoK02,
author = {Russell Impagliazzo and
Jan Kraj{\'{\i}}cek},
title = {A Note on Conservativity Relations among Bounded Arithmetic Theories},
journal = {Math. Log. Q.},
volume = {48},
number = {3},
pages = {375--377},
year = {2002},
url = {https://doi.org/10.1002/1521-3870(200204)48:3\&\#60;375::AID-MALQ375\&\#62;3.0.CO;2-L},
doi = {10.1002/1521-3870(200204)48:3\&\#60;375::AID-MALQ375\&\#62;3.0.CO;2-L},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/ImpagliazzoK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Krajicek02,
author = {Jan Kraj{\'{\i}}cek},
title = {Interpolation and Approximate Semantic Derivations},
journal = {Math. Log. Q.},
volume = {48},
number = {4},
pages = {602--606},
year = {2002},
url = {https://doi.org/10.1002/1521-3870(200211)48:4\&\#60;602::AID-MALQ602\&\#62;3.0.CO;2-J},
doi = {10.1002/1521-3870(200211)48:4\&\#60;602::AID-MALQ602\&\#62;3.0.CO;2-J},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Krajicek02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bsl/Krajicek01,
author = {Jan Kraj{\'{\i}}cek},
title = {Tautologies from pseudo-random generators},
journal = {Bull. Symb. Log.},
volume = {7},
number = {2},
pages = {197--212},
year = {2001},
url = {https://doi.org/10.2307/2687774},
doi = {10.2307/2687774},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bsl/Krajicek01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bsl/KrajicekS00,
author = {Jan Kraj{\'{\i}}cek and
Thomas Scanlon},
title = {Combinatorics with definable sets: Euler characteristics and Grothendieck
rings},
journal = {Bull. Symb. Log.},
volume = {6},
number = {3},
pages = {311--330},
year = {2000},
url = {https://doi.org/10.2307/421058},
doi = {10.2307/421058},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bsl/KrajicekS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-033,
author = {Jan Kraj{\'{\i}}cek},
title = {Tautologies from pseudo-random generators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-033}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-033/index.html},
eprinttype = {ECCC},
eprint = {TR00-033},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/ChiariK99,
author = {Mario Chiari and
Jan Kraj{\'{\i}}cek},
title = {Lifting independence results in bounded arithmetic},
journal = {Arch. Math. Log.},
volume = {38},
number = {2},
pages = {123--138},
year = {1999},
url = {https://doi.org/10.1007/s001530050118},
doi = {10.1007/S001530050118},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/ChiariK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KrajicekP98,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k},
title = {Some Consequences of Cryptographical Conjectures for S\({}^{\mbox{1}}\)\({}_{\mbox{2}}\)
and {EF}},
journal = {Inf. Comput.},
volume = {140},
number = {1},
pages = {82--94},
year = {1998},
url = {https://doi.org/10.1006/inco.1997.2674},
doi = {10.1006/INCO.1997.2674},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/KrajicekP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/ChiariK98,
author = {Mario Chiari and
Jan Kraj{\'{\i}}cek},
title = {Witnessing Functions in Bounded Arithmetic and Search Problems},
journal = {J. Symb. Log.},
volume = {63},
number = {3},
pages = {1095--1115},
year = {1998},
url = {https://doi.org/10.2307/2586729},
doi = {10.2307/2586729},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/ChiariK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek98,
author = {Jan Kraj{\'{\i}}cek},
title = {Discretely Ordered Modules as a First-Order Extension of The Cutting
Planes Proof System},
journal = {J. Symb. Log.},
volume = {63},
number = {4},
pages = {1582--1596},
year = {1998},
url = {https://doi.org/10.2307/2586668},
doi = {10.2307/2586668},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Krajicek98,
author = {Jan Kraj{\'{\i}}cek},
title = {Interpolation by a Game},
journal = {Math. Log. Q.},
volume = {44},
pages = {450--458},
year = {1998},
url = {https://doi.org/10.1002/malq.19980440403},
doi = {10.1002/MALQ.19980440403},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Krajicek98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sLogica/BaazHSK98,
author = {Matthias Baaz and
Petr H{\'{a}}jek and
David Svejda and
Jan Kraj{\'{\i}}cek},
title = {Embedding Logics into Product Logic},
journal = {Stud Logica},
volume = {61},
number = {1},
pages = {35--47},
year = {1998},
url = {https://doi.org/10.1023/A:1005026229560},
doi = {10.1023/A:1005026229560},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sLogica/BaazHSK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BussIPRS97,
author = {Samuel R. Buss and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k and
Alexander A. Razborov and
Jir{\'{\i}} Sgall},
title = {Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems
with Modular Counting},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {256--298},
year = {1997},
url = {https://doi.org/10.1007/BF01294258},
doi = {10.1007/BF01294258},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BussIPRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek97,
author = {Jan Kraj{\'{\i}}cek},
title = {Interpolation Theorems, Lower Bounds for Proof Systems, and Independence
Results for Bounded Arithmetic},
journal = {J. Symb. Log.},
volume = {62},
number = {2},
pages = {457--486},
year = {1997},
url = {https://doi.org/10.2307/2275541},
doi = {10.2307/2275541},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Krajicek97,
author = {Jan Kraj{\'{\i}}cek},
editor = {Igor Pr{\'{\i}}vara and
Peter Ruzicka},
title = {Lower Bounds for a Proof System with an Expentential Speed-up over
Constant-Depth Frege Systems and over Polynomial Calculus},
booktitle = {Mathematical Foundations of Computer Science 1997, 22nd International
Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1295},
pages = {85--90},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0029951},
doi = {10.1007/BFB0029951},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Krajicek97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-015,
author = {Jan Kraj{\'{\i}}cek},
title = {Interpolation by a Game},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-015}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-015/index.html},
eprinttype = {ECCC},
eprint = {TR97-015},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0082595,
author = {Jan Kraj{\'{\i}}cek},
title = {Bounded arithmetic, propositional logic, and complexity theory},
series = {Encyclopedia of mathematics and its applications},
volume = {60},
publisher = {Cambridge University Press},
year = {1995},
isbn = {978-0-521-45205-2},
timestamp = {Fri, 19 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0082595.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrajicekPW95,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k and
Alan R. Woods},
title = {An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs
of the Pigeonhole Principle},
journal = {Random Struct. Algorithms},
volume = {7},
number = {1},
pages = {15--40},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240070103},
doi = {10.1002/RSA.3240070103},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrajicekPW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/logicColl/Krajicek95,
author = {Jan Kraj{\'{\i}}cek},
editor = {Johann A. Makowsky and
Elena V. Ravve},
title = {Extensions of Models of {PV}},
booktitle = {Proceedings of the Annual European Summer Meeting of the Association
of Symbolic Logic, Logic Colloquium 1995, Haifa, Israel, August 9-18,
1995},
series = {Lecture Notes in Logic},
volume = {11},
pages = {104--114},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/978-3-662-22108-2\_8},
doi = {10.1007/978-3-662-22108-2\_8},
timestamp = {Fri, 15 May 2020 14:19:27 +0200},
biburl = {https://dblp.org/rec/conf/logicColl/Krajicek95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Krajicek94,
author = {Jan Kraj{\'{\i}}cek},
title = {Lower Bounds to the Size of Constant-Depth Propositional Proofs},
journal = {J. Symb. Log.},
volume = {59},
number = {1},
pages = {73--86},
year = {1994},
url = {https://doi.org/10.2307/2275250},
doi = {10.2307/2275250},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Krajicek94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeameIKPP94,
author = {Paul Beame and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Toniann Pitassi and
Pavel Pudl{\'{a}}k},
title = {Lower Bound on Hilbert's Nullstellensatz and propositional proofs},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {794--806},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365714},
doi = {10.1109/SFCS.1994.365714},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeameIKPP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lcc/KrajicekP94,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k},
editor = {Daniel Leivant},
title = {Some Consequences of Cryptographical Conjectures for S{\_}2{\^{}}1
and {EF}},
booktitle = {Logical and Computational Complexity. Selected Papers. Logic and Computational
Complexity, International Workshop {LCC} '94, Indianapolis, Indiana,
USA, 13-16 October 1994},
series = {Lecture Notes in Computer Science},
volume = {960},
pages = {210--220},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-60178-3\_86},
doi = {10.1007/3-540-60178-3\_86},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/lcc/KrajicekP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR94-018,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k and
Alan R. Woods},
title = {An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs
of the Pigeonhole Principle},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR94-018}},
year = {1994},
url = {https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-018/index.html},
eprinttype = {ECCC},
eprint = {TR94-018},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR94-018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/KrajicekT92,
author = {Jan Kraj{\'{\i}}cek and
Gaisi Takeuti},
title = {On Induction-Free Provability},
journal = {Ann. Math. Artif. Intell.},
volume = {6},
number = {1-3},
pages = {107--125},
year = {1992},
url = {https://doi.org/10.1007/BF01531024},
doi = {10.1007/BF01531024},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/KrajicekT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameIKPPW92,
author = {Paul Beame and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Toniann Pitassi and
Pavel Pudl{\'{a}}k and
Alan R. Woods},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Exponential Lower Bounds for the Pigeonhole Principle},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {200--220},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129733},
doi = {10.1145/129712.129733},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeameIKPPW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/KrajicekPT91,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k and
Gaisi Takeuti},
title = {Bounded Arithmetic and the Polynomial Hierarchy},
journal = {Ann. Pure Appl. Log.},
volume = {52},
number = {1-2},
pages = {143--153},
year = {1991},
url = {https://doi.org/10.1016/0168-0072(91)90043-L},
doi = {10.1016/0168-0072(91)90043-L},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apal/KrajicekPT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Krajicek90,
author = {Jan Kraj{\'{\i}}cek},
title = {Exponentiation and Second-Order Bounded Arithmetic},
journal = {Ann. Pure Appl. Log.},
volume = {48},
number = {3},
pages = {261--276},
year = {1990},
url = {https://doi.org/10.1016/0168-0072(90)90023-U},
doi = {10.1016/0168-0072(90)90023-U},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Krajicek90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/KrajicekP90,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k},
title = {Quantified propositional calculi and fragments of bounded arithmetic},
journal = {Math. Log. Q.},
volume = {36},
number = {1},
pages = {29--46},
year = {1990},
url = {https://doi.org/10.1002/malq.19900360106},
doi = {10.1002/MALQ.19900360106},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/KrajicekP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KrajicekPS90,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
editor = {Branislav Rovan},
title = {Interactive Computations of Optimal Solutions},
booktitle = {Mathematical Foundations of Computer Science 1990, MFCS'90, Bansk{\'{a}}
Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {452},
pages = {48--60},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0029595},
doi = {10.1007/BFB0029595},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/KrajicekPS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/KrajicekP89,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k},
title = {On the structure of initial segments of models of arithmetic},
journal = {Arch. Math. Log.},
volume = {28},
number = {2},
pages = {91--98},
year = {1989},
url = {https://doi.org/10.1007/BF01633984},
doi = {10.1007/BF01633984},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/KrajicekP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Krajicek89,
author = {Jan Kraj{\'{\i}}cek},
title = {On the Number of Steps in Proofs},
journal = {Ann. Pure Appl. Log.},
volume = {41},
number = {2},
pages = {153--178},
year = {1989},
url = {https://doi.org/10.1016/0168-0072(89)90012-2},
doi = {10.1016/0168-0072(89)90012-2},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Krajicek89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/KrajicekP89,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k},
title = {Propositional Proof Systems, the Consistency of First Order Theories
and the Complexity of Computations},
journal = {J. Symb. Log.},
volume = {54},
number = {3},
pages = {1063--1079},
year = {1989},
url = {https://doi.org/10.2307/2274765},
doi = {10.2307/2274765},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/KrajicekP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/KrajicekP89,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k},
editor = {Egon B{\"{o}}rger and
Hans Kleine B{\"{u}}ning and
Michael M. Richter},
title = {Propositional Provability and Models of Weak Arithmetic},
booktitle = {{CSL} '89, 3rd Workshop on Computer Science Logic, Kaiserslautern,
Germany, October 2-6, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {440},
pages = {193--210},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-52753-2\_40},
doi = {10.1007/3-540-52753-2\_40},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/KrajicekP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/KrajicekP88,
author = {Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k},
title = {The number of proof lines and the size of proofs in first order logic},
journal = {Arch. Math. Log.},
volume = {27},
number = {1},
pages = {69--84},
year = {1988},
url = {https://doi.org/10.1007/BF01625836},
doi = {10.1007/BF01625836},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/KrajicekP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Krajicek88,
author = {Jan Kraj{\'{\i}}cek},
title = {Some Results and Problems in The Modal Set Theory {MST}},
journal = {Math. Log. Q.},
volume = {34},
number = {2},
pages = {123--134},
year = {1988},
url = {https://doi.org/10.1002/malq.19880340206},
doi = {10.1002/MALQ.19880340206},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Krajicek88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Krajicek87,
author = {Jan Kraj{\'{\i}}cek},
title = {A note on proofs of falsehood},
journal = {Arch. Math. Log.},
volume = {26},
number = {1},
pages = {169--176},
year = {1987},
url = {https://doi.org/10.1007/BF02017501},
doi = {10.1007/BF02017501},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Krajicek87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Krajicek87,
author = {Jan Kraj{\'{\i}}cek},
title = {A Possible Modal Formulation of Comprehension Scheme},
journal = {Math. Log. Q.},
volume = {33},
number = {5},
pages = {461--480},
year = {1987},
url = {https://doi.org/10.1002/malq.19870330511},
doi = {10.1002/MALQ.19870330511},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Krajicek87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Krajicek85,
author = {Jan Kraj{\'{\i}}cek},
title = {Some Theorems on the Lattice of Local Interpretability Types},
journal = {Math. Log. Q.},
volume = {31},
number = {29-30},
pages = {449--460},
year = {1985},
url = {https://doi.org/10.1002/malq.19850312902},
doi = {10.1002/MALQ.19850312902},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Krajicek85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
