Jan Krajícek - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 77 from 77

2024

On the existence of Strong Proof Complexity GeneratorsJan Krajícek. bsl, 30(1):20-40, 2024. [doi]

2023

The Cook-Reckhow DefinitionJan Krajícek. In Bruce M. Kapron, editor, Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook. Volume 43 of ACM Books, pages 83-94, ACM, 2023. [doi]

Extended Nullstellensatz proof systemsJan Krajícek. eccc, TR23, 2023. [doi]

A proof complexity conjecture and the Incompleteness theoremJan Krajícek. eccc, TR23, 2023. [doi]

2022

Information in Propositional Proofs and Algorithmic Proof SearchJan Krajícek. JSYML, 87(2):852-869, 2022. [doi]

On the existence of strong proof complexity generatorsJan Krajícek. eccc, TR22, 2022. [doi]

2021

Information in propositional proofs and algorithmic proof searchJan Krajícek. eccc, 28:53, 2021. [doi]

Small Circuits and Dual Weak PHP in the Universal Theory of p-time AlgorithmsJan Krajícek. tocl, 22(2), 2021. [doi]

2020

Consistency of circuit lower bounds with bounded theoriesJan Bydzovsky, Jan Krajícek, Igor Carboni Oliveira. lmcs, 16(2), 2020. [doi]

A limitation on the KPT interpolationJan Krajícek. lmcs, 16(3), 2020. [doi]

2019

Consistency of circuit lower bounds with bounded theoriesJan Bydzovsky, Igor Carboni Oliveira, Jan Krajícek. eccc, 26:77, 2019. [doi]

2018

On monotone circuits with local oracles and clique lower boundsJan Krajícek, Igor Carboni Oliveira. cjtcs, 2018, 2018. [doi]

Randomized feasible interpolation and monotone circuits with a local oracleJan Krajícek. jml, 18(2):1850012, 2018. [doi]

2016

Unprovability of circuit upper bounds in Cook's theory PVJan Krajícek, Igor C. Oliveira. eccc, 23:71, 2016. [doi]

2014

Optimal algorithms and proofs (Dagstuhl Seminar 14421)Olaf Beyersdorff, Edward A. Hirsch, Jan Krajícek, Rahul Santhanam. dagstuhl-reports, 4(10):51-68, 2014. [doi]

2013

A saturation property of structures obtained by forcing with a compact family of random variablesJan Krajícek. AML, 52(1-2):19-28, 2013. [doi]

A reduction of proof complexity to computational complexity for $AC^0[p]$ Frege systemsJan Krajícek. eccc, 20:156, 2013. [doi]

2012

A note on SAT algorithms and proof complexityJan Krajícek. ipl, 112(12):490-493, 2012. [doi]

2011

Forcing with Random Variables and Proof ComplexityJan Krajícek. Volume 382 of London Mathematical Society lecture note series, Cambridge University Press, 2011. [doi]

On the Proof Complexity of the Nisan-Wigderson Generator based on a Hard NP ∩ coNP functionJan Krajícek. jml, 11(1), 2011. [doi]

A note on propositional proof complexity of some Ramsey-type statementsJan Krajícek. AML, 50(1-2):245-255, 2011. [doi]

2010

A form of feasible interpolation for constant depth Frege systemsJan Krajícek. JSYML, 75(2):774-784, 2010. [doi]

On the proof complexity of the Nisan-Wigderson generator based on a hard NP cap coNP functionJan Krajícek. eccc, 17:54, 2010. [doi]

From Feasible Proofs to Feasible ComputationsJan Krajícek. csl 2010: 22-31 [doi]

2008

An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagramsJan Krajícek. JSYML, 73(1):227-237, 2008. [doi]

2007

Consequences of the provability of ::::NP:::: SUBSET OF OR EQUAL TO ::::P/poly::::Stephen Cook, Jan Krajícek. JSYML, 72(4):1353-1371, 2007. [doi]

NP search problems in low fragments of bounded arithmeticJan Krajícek, Alan Skelley, Neil Thapen. JSYML, 72(2):649-672, 2007. [doi]

Substitutions into propositional tautologiesJan Krajícek. ipl, 101(4):163-167, 2007. [doi]

An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagramsJan Krajícek. eccc, 14(007), 2007. [doi]

2006

Proof Complexity GeneratorsJan Krajícek. acid 2006: 3

Forcing with Random Variables and Proof ComplexityJan Krajícek. cie 2006: 277-278 [doi]

2005

Hardness assumptions in the foundations of theoretical computer scienceJan Krajícek. AML, 44(6):667-675, 2005. [doi]

Structured pigeonhole principle, search problems and hard tautologiesJan Krajícek. JSYML, 70(2):619-630, 2005. [doi]

2004

Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower boundsJan Krajícek. JSYML, 69(1):265-286, 2004. [doi]

Combinatorics of first order structures and propositional proof systemsJan Krajícek. AML, 43(4):427-441, 2004. [doi]

Diagonalization in proof complexityJan Krajícek. eccc, (018), 2004. [doi]

Implicit proofsJan Krajícek. JSYML, 69(2):387-397, 2004. [doi]

Approximate Euler characteristic, dimension, and weak pigeonhole principlesJan Krajícek. JSYML, 69(1):201-214, 2004. [doi]

2003

Implicit proofsJan Krajícek. eccc, (055), 2003. [doi]

Dehn Function and Length of ProofsJan Krajícek. ijac, 13(5):527-541, 2003. [doi]

2002

A Note on Conservativity Relations among Bounded Arithmetic TheoriesRussell Impagliazzo, Jan Krajícek. mlq, 48(3):375-377, 2002. [doi]

Interpolation and Approximate Semantic DerivationsJan Krajícek. mlq, 48(4):602-606, 2002. [doi]

2001

Tautologies from pseudo-random generatorsJan Krajícek. bsl, 7(2):197-212, 2001. [doi]

2000

Tautologies from pseudo-random generatorsJan Krajícek. eccc, 7(33), 2000. [doi]

Combinatorics with definable sets: Euler characteristics and Grothendieck ringsJan Krajícek, Thomas Scanlon. bsl, 3(3):311-330, 2000. [doi]

1999

Lifting independence results in bounded arithmeticMario Chiari, Jan Krajícek. AML, 38(2):123-138, 1999. [doi]

1998

Embedding Logics into Product LogicMatthias Baaz, Petr Hájek, David Svejda, Jan Krajícek. sLogica, 61(1):35-47, 1998.

Witnessing Functions in Bounded Arithmetic and Search ProblemsMario Chiari, Jan Krajícek. JSYML, 63(3):1095-1115, 1998.

Some Consequences of Cryptographical Conjectures for S:::1:::::2:: and EFJan Krajícek, Pavel Pudlák. iandc, 140(1):82-94, 1998.

Interpolation by a GameJan Krajícek. mlq, 44:450-458, 1998.

Discretely Ordered Modules as a First-Order Extension of The Cutting Planes Proof SystemJan Krajícek. JSYML, 63(4):1582-1596, 1998.

1997

Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular CountingSamuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jiri Sgall. cc, 6(3):256-298, 1997.

Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded ArithmeticJan Krajícek. JSYML, 62(2):457-486, 1997.

Interpolation by a GameJan Krajícek. eccc, 4(15), 1997. [doi]

Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial CalculusJan Krajícek. mfcs 1997: 85-90

1995

Bounded arithmetic, propositional logic, and complexity theoryJan Krajícek. Volume 60 of Encyclopedia of mathematics and its applications, Cambridge University Press, 1995.

An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole PrincipleJan Krajícek, Pavel Pudlák, Alan R. Woods. rsa, 7(1):15-40, 1995.

Extensions of Models of PVJan Krajícek. logicColl 1998: 104-114 [doi]

1994

1992

Exponential Lower Bounds for the Pigeonhole PrinciplePaul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods. stoc 1992: 200-220

On Induction-Free ProvabilityJan Krajícek, Gaisi Takeuti. AMAI, 6(1-3):107-125, 1992.

1991

Bounded Arithmetic and the Polynomial HierarchyJan Krajícek, Pavel Pudlák, Gaisi Takeuti. APAL, 52(1-2):143-153, 1991.

1990

Exponentiation and Second-Order Bounded ArithmeticJan Krajícek. APAL, 48(3):261-276, 1990.

Quantified propositional calculi and fragments of bounded arithmeticJan Krajícek, Pavel Pudlák. mlq, 36(1):29-46, 1990. [doi]

Interactive Computations of Optimal SolutionsJan Krajícek, Pavel Pudlák, Jiri Sgall. mfcs 1990: 48-60

1989

On the Number of Steps in ProofsJan Krajícek. APAL, 41(2):153-178, 1989.

On the structure of initial segments of models of arithmeticJan Krajícek, Pavel Pudlák. AML, 28(2):91-98, 1989. [doi]

Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of ComputationsJan Krajícek, Pavel Pudlák. JSYML, 54(3):1063-1079, 1989.

Propositional Provability and Models of Weak ArithmeticJan Krajícek, Pavel Pudlák. csl 1990: 193-210

1988

Some Results and Problems in The Modal Set Theory MSTJan Krajícek. mlq, 34(2):123-134, 1988. [doi]

The number of proof lines and the size of proofs in first order logicJan Krajícek, Pavel Pudlák. AML, 27(1):69-84, 1988. [doi]

1987

A note on proofs of falsehoodJan Krajícek. AML, 26(1):169-176, 1987. [doi]

A Possible Modal Formulation of Comprehension SchemeJan Krajícek. mlq, 33(5):461-480, 1987. [doi]

1985

Some Theorems on the Lattice of Local Interpretability TypesJan Krajícek. mlq, 31(29-30):449-460, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL