Artikel dengan mandat akses publik - Pavel PudlákPelajari lebih lanjut
Tidak tersedia di mana pun: 1
Udine, Italy July 23–28, 2018
S Demri, AS Kechris, C Laskowski, A Marcone, A Montalban, P Pudlák, ...
The Bulletin of Symbolic Logic 25 (2), 2019
Mandat: US National Science Foundation, Government of Spain
Tersedia di suatu tempat: 14
Random formulas, monotone circuits, and interpolation
P Hrubeš, P Pudlák
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Mandat: European Commission
Incompleteness in the finite domain
P Pudlák
Bulletin of Symbolic Logic 23 (4), 405-441, 2017
Mandat: European Commission
The space complexity of cutting planes refutations
N Galesi, P Pudlák, N Thapen
Leibniz International Proceedings in Informatics, LIPIcs 33, 433-447, 2015
Mandat: European Commission
On the complexity of finding falsifying assignments for Herbrand disjunctions
P Pudlák
Archive for Mathematical Logic 54 (7), 769-783, 2015
Mandat: European Commission
The complexity of proving that a graph is Ramsey
M Lauria, P Pudlák, V Rödl, N Thapen
Combinatorica 37, 253-268, 2017
Mandat: US National Science Foundation, European Commission
On convex complexity measures
P Hrubeš, S Jukna, A Kulikov, P Pudlak
Theoretical Computer Science 411 (16-18), 1842-1854, 2010
Mandat: German Research Foundation
Random resolution refutations
P Pudlák, N Thapen
computational complexity 28, 185-239, 2019
Mandat: European Commission
Representations of monotone Boolean functions by linear programs
MDO Oliveira, P Pudlák
ACM Transactions on Computation Theory (TOCT) 11 (4), 1-31, 2019
Mandat: European Commission
Beating brute force for (quantified) satisfiability of circuits of bounded treewidth
D Lokshtanov, I Mikhailin, R Paturi, P Pudlák
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Mandat: US National Science Foundation, US Department of Defense
Santha-Vazirani sources, deterministic condensers and very strong extractors
D Gavinsky, P Pudlák
Theory of Computing Systems 64 (6), 1140-1154, 2020
Mandat: National Research Foundation, Singapore
Extractors for small zero-fixing sources
P Pudlák, V Rödl
Combinatorica 42 (4), 587-616, 2022
Mandat: US National Science Foundation
The canonical pairs of bounded depth Frege systems
P Pudlák
Annals of Pure and Applied Logic 172 (2), 102892, 2021
Mandat: European Commission
A wild model of linear arithmetic and discretely ordered modules
P Glivický, P Pudlák
Mathematical Logic Quarterly 63 (6), 501-508, 2017
Mandat: European Commission
Bounds on functionality and symmetric difference–two intriguing graph parameters
P Dvořák, L Folwarczný, M Opler, P Pudlák, R Šámal, TA Vu
International Workshop on Graph-Theoretic Concepts in Computer Science, 305-318, 2023
Mandat: European Commission
Informasi terbitan dan pendanaan ditentukan secara otomatis oleh program komputer