Pudlák, Pavel
130  Ergebnisse:
Personensuche X
?
1

Bounds on Functionality and Symmetric Difference – Two Intr..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
 
?
 
?
3

On matrices potentially useful for tree codes:

Pudlák, Pavel
Information Processing Letters.  174 (2022)  - p. 106180 , 2022
 
?
4

Linear branching programs and directional affine extractors:

, In: Proceedings of the 37th Computational Complexity Conference,
 
?
5

The canonical pairs of bounded depth Frege systems:

Pudlák, Pavel
Annals of Pure and Applied Logic.  172 (2021)  2 - p. 102892 , 2021
 
?
6

Santha-Vazirani sources, deterministic condensers and very ..:

Gavinsky, Dmitry ; Pudlák, Pavel
Theory of Computing Systems.  64 (2020)  6 - p. 1140-1154 , 2020
 
?
7

Random resolution refutations:

Pudlák, Pavel ; Thapen, Neil
computational complexity.  28 (2019)  2 - p. 185-239 , 2019
 
?
 
?
9

Representations of Monotone Boolean Functions by Linear Pro..:

Oliveira, Mateus De Oliveira ; Pudlák, Pavel
ACM Transactions on Computation Theory (TOCT).  11 (2019)  4 - p. 1-31 , 2019
 
?
10

Beating Brute Force for (Quantified) Satisfiability of Circ..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
 
?
11

A note on monotone real circuits:

Hrubeš, Pavel ; Pudlák, Pavel
Information Processing Letters.  131 (2018)  - p. 15-19 , 2018
 
?
12

Beating brute force for (quantified) satisfiability of circ..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
 
?
13

A wild model of linear arithmetic and discretely ordered mo..:

Glivický, Petr ; Pudlák, Pavel
Mathematical Logic Quarterly.  63 (2017)  6 - p. 501-508 , 2017
 
?
14

Random resolution refutations:

, In: Proceedings of the 32nd Computational Complexity Conference,
Pudlák, Pavel ; Thapen, Neil - p. 1-10 , 2017
 
?
15

Representations of monotone Boolean functions by linear pro..:

, In: Proceedings of the 32nd Computational Complexity Conference,
 
1-15
Mehr Literatur finden