UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Metamathematics of First-Order Arithmetic

1, 2017

Volltextzugriff (PDF)

On matrices potentially useful for tree codes

Information processing letters, 2022-03, Vol.174, p.106180, Article 106180

Pudlák, Pavel

2022

Volltextzugriff (PDF)

Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook . Edited by Bruce M. Kapron, ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein: - Michelle Waitzman. Stephen Cook: Complexity’s Humble Hero , pp. 3–28. - Bruce M. Kapron and Stephen A. Cook, ACM Interview of Stephen A. Cook by Bruce M. Kapron , pp. 29–44. - Stephen A. Cook, Overview of Computational Complexity , pp. 47–70. - Christos H. Papadimitriou, Cook’s NP-Completeness Paper a

The bulletin of symbolic logic, 2023-12, Vol.29 (4), p.657-660

Pudlák, Pavel

2023

Volltextzugriff (PDF)

The canonical pairs of bounded depth Frege systems

Annals of pure and applied logic, 2021-02, Vol.172 (2), p.102892, Article 102892

Pudlák, Pavel

2021

Volltextzugriff (PDF)

Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction

Pudlak, Pavel

2013., 2013

Volltextzugriff (PDF)

Linear tree codes and the problem of explicit constructions

Linear algebra and its applications, 2016-02, Vol.490, p.124-144

Pudlák, Pavel

2016

Volltextzugriff (PDF)

INCOMPLETENESS IN THE FINITE DOMAIN

The bulletin of symbolic logic, 2017-12, Vol.23 (4), p.405-441

PUDLÁK, PAVEL

2017

Volltextzugriff (PDF)

Santha-Vazirani sources, deterministic condensers and very strong extractors

Theory of computing systems, 2020-08, Vol.64 (6), p.1140-1154

2020

Volltextzugriff (PDF)

Extractors for Small Zero-Fixing Sources

Combinatorica (Budapest. 1981), 2022-08, Vol.42 (4), p.587-616

2022

Volltextzugriff (PDF)

On the Ramsey numbers of daisies I

Combinatorics, probability & computing, 2024-09, p.1-12

2024

Volltextzugriff (PDF)

On the complexity of finding falsifying assignments for Herbrand disjunctions

Archive for mathematical logic, 2015-11, Vol.54 (7-8), p.769-783

Pudlák, Pavel

2015

Volltextzugriff (PDF)

A note on monotone real circuits

Information processing letters, 2018-03, Vol.131, p.15-19

2018

Volltextzugriff (PDF)

Random resolution refutations

Computational complexity, 2019-06, Vol.28 (2), p.185-239

2019

Volltextzugriff (PDF)

Partition Expanders

Theory of computing systems, 2017-04, Vol.60 (3), p.378-395

2017

Volltextzugriff (PDF)

A lower bound on the size of resolution proofs of the Ramsey theorem

Information processing letters, 2012-08, Vol.112 (14-15), p.610-611

Pudllk, Pavel

2012

Volltextzugriff (PDF)

Representations of Monotone Boolean Functions by Linear Programs

ACM transactions on computation theory, 2019-09, Vol.11 (4), p.1-31

2019

Volltextzugriff (PDF)

The complexity of proving that a graph is Ramsey

Combinatorica (Budapest. 1981), 2017-04, Vol.37 (2), p.253-268

2017

Volltextzugriff (PDF)

A wild model of linear arithmetic and discretely ordered modules

Mathematical logic quarterly, 2017-12, Vol.63 (6), p.501-508

2017

Volltextzugriff (PDF)

An improved exponential-time algorithm for k -SAT

Journal of the ACM, 2005-05, Vol.52 (3), p.337-364

2005

Volltextzugriff (PDF)

Parity Games and Propositional Proofs

ACM transactions on computational logic, 2014-04, Vol.15 (2), p.1-30

2014

Volltextzugriff (PDF)

Lower bounds for resolution and cutting plane proofs and monotone computations

The Journal of symbolic logic, 1997-09, Vol.62 (3), p.981-998

Pudlak, Pavel

1997

Volltextzugriff (PDF)

On the joint entropy of $d$-wise-independent variables

Commentationes mathematicae Universitatis Carolinae, 2016-01, Vol.57 (3), p.333-343

2016

Volltextzugriff (PDF)

Quantum deduction rules

Annals of pure and applied logic, 2009, Vol.157 (1), p.16-29

Pudlák, Pavel

2009

Volltextzugriff (PDF)

Alternating minima and maxima, Nash equilibria and Bounded Arithmetic

Annals of pure and applied logic, 2012-05, Vol.163 (5), p.604-614

2012

Volltextzugriff (PDF)

On reducibility and symmetry of disjoint NP pairs

Theoretical computer science, 2003-02, Vol.295 (1-3), p.323-339

PUDLAK, Pavel

2003

Volltextzugriff (PDF)

1 – 25 von 212

Menü

Weitere Dienste

Einstellungen

Metamathematics of First-Order Arithmetic

On matrices potentially useful for tree codes

The canonical pairs of bounded depth Frege systems

Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction

Linear tree codes and the problem of explicit constructions

INCOMPLETENESS IN THE FINITE DOMAIN

Santha-Vazirani sources, deterministic condensers and very strong extractors

Extractors for Small Zero-Fixing Sources

On the Ramsey numbers of daisies I

On the complexity of finding falsifying assignments for Herbrand disjunctions

A note on monotone real circuits

Random resolution refutations

Partition Expanders

A lower bound on the size of resolution proofs of the Ramsey theorem

Representations of Monotone Boolean Functions by Linear Programs

The complexity of proving that a graph is Ramsey

A wild model of linear arithmetic and discretely ordered modules

An improved exponential-time algorithm for k -SAT

Parity Games and Propositional Proofs

Lower bounds for resolution and cutting plane proofs and monotone computations

On the joint entropy of $d$-wise-independent variables

Quantum deduction rules

Alternating minima and maxima, Nash equilibria and Bounded Arithmetic

On reducibility and symmetry of disjoint NP pairs

Suchergebnisse filtern