Leszek Aleksander Kolodziejczyk

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 17

Top Topics

Heuristic Search Algorithms

Search Problems

Top Venues

Ann. Pure Appl. Log.

Publications

Leszek Aleksander Kolodziejczyk, Neil Thapen
The strength of the dominance rule. CoRR (2024)
Leszek Aleksander Kolodziejczyk, Neil Thapen
The Strength of the Dominance Rule. SAT (2024)
Leszek Aleksander Kolodziejczyk, Katarzyna W. Kowalik, Keita Yokoyama
How Strong is Ramsey's Theorem if infinity can be Weak? J. Symb. Log. 88 (2) (2023)
Leszek Aleksander Kolodziejczyk, Neil Thapen
Approximate counting and NP search problems. J. Math. Log. 22 (3) (2022)
Marta Fiori-Carones, Leszek Aleksander Kolodziejczyk, Katarzyna W. Kowalik
Weaker cousins of Ramsey's theorem over a weak base theory. Ann. Pure Appl. Log. 172 (10) (2021)
Leszek Aleksander Kolodziejczyk, Keita Yokoyama
In Search of the First-Order Part of Ramsey's Theorem for Pairs. CiE (2021)
Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski
New bounds on the strength of some restrictions of Hindman's Theorem. Comput. 9 (2) (2020)
Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen
Polynomial Calculus Space and Resolution Width. FOCS (2019)
Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen
Polynomial calculus space and resolution width. Electron. Colloquium Comput. Complex. 26 (2019)
Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, Michal Skrzypczak
The logical strength of Büchi's decidability theorem. Log. Methods Comput. Sci. 15 (2) (2019)
Leszek Aleksander Kolodziejczyk, Neil Thapen
Approximate counting and NP search problems. CoRR (2018)
Michal Garlík, Leszek Aleksander Kolodziejczyk
Some Subsystems of Constant-Depth Frege with Parity. ACM Trans. Comput. Log. 19 (4) (2018)
Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski
New Bounds on the Strength of Some Restrictions of Hindman's Theorem. CiE (2017)
Leszek Aleksander Kolodziejczyk
End-Extensions of Models of Weak Arithmetic from Complexity-Theoretic Containments. J. Symb. Log. 81 (3) (2016)
Leszek Aleksander Kolodziejczyk, Henryk Michalewski
How unprovable is Rabin's decidability theorem? LICS (2016)
Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, Michal Skrzypczak
The logical strength of Büchi's decidability theorem. CoRR (2016)
Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, Michal Skrzypczak
The Logical Strength of Büchi's Decidability Theorem. CSL (2016)
Leszek Aleksander Kolodziejczyk, Henryk Michalewski
How unprovable is Rabin's decidability theorem? CoRR (2015)
Leszek Aleksander Kolodziejczyk, Keita Yokoyama
Categorical characterizations of the natural numbers require primitive recursion. Ann. Pure Appl. Log. 166 (2) (2015)
Samuel R. Buss, Leszek Aleksander Kolodziejczyk, Neil Thapen
Fragments of Approximate Counting. J. Symb. Log. 79 (2) (2014)
Samuel R. Buss, Leszek Aleksander Kolodziejczyk
Small Stone in Pool. Log. Methods Comput. Sci. 10 (2) (2014)
Emil Jerábek, Leszek Aleksander Kolodziejczyk
Real closures of models of weak arithmetic. Arch. Math. Log. 52 (1-2) (2013)
Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak
Solutions in XML data exchange. J. Comput. Syst. Sci. 79 (6) (2013)
Zofia Adamowicz, Leszek Aleksander Kolodziejczyk, Jeff B. Paris
Truth definitions without exponentiation and the Σ₁ collection scheme. J. Symb. Log. 77 (2) (2012)
Leszek Aleksander Kolodziejczyk
Independence results for variants of sharply bounded induction. Ann. Pure Appl. Log. 162 (12) (2011)
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen
The provably total NP search problems of weak second order bounded arithmetic. Ann. Pure Appl. Log. 162 (6) (2011)
Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak
Solutions in XML data exchange. ICDT (2011)
Sedki Boughattas, Leszek Aleksander Kolodziejczyk
The strength of sharply bounded induction requires MSP. Ann. Pure Appl. Log. 161 (4) (2010)
Zofia Adamowicz, Leszek Aleksander Kolodziejczyk
collection scheme and fragments of bounded arithmetic. Math. Log. Q. 56 (2) (2010)
Leszek Aleksander Kolodziejczyk, Neil Thapen
. Math. Log. Q. 55 (5) (2009)
Leszek Aleksander Kolodziejczyk, Neil Thapen
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails. J. Symb. Log. 73 (2) (2008)
Leszek Aleksander Kolodziejczyk, Neil Thapen
. CiE (2007)
Zofia Adamowicz, Leszek Aleksander Kolodziejczyk
complexity hierarchy in models for fragments of bounded arithmetic. Ann. Pure Appl. Log. 145 (1) (2007)
Leszek Aleksander Kolodziejczyk
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories. J. Symb. Log. 71 (2) (2006)
Leszek Aleksander Kolodziejczyk
A finite model-theoretical proof of a property of bounded query classes within PH. J. Symb. Log. 69 (4) (2004)
Leszek Aleksander Kolodziejczyk
Truth definitions in finite models. J. Symb. Log. 69 (1) (2004)
Zofia Adamowicz, Leszek Aleksander Kolodziejczyk
Well-behaved principles alternative to bounded induction. Theor. Comput. Sci. 322 (1) (2004)