2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2013
The complexity of proving that a graph is Ramsey
Massimo Lauria, Pavel Pudlák, Vojtěch Rödl +1
We say that a graph with vertices is -Ramsey if it does not contain either a clique or an independent set of size . We define a CNF formula which expresses this pr…
math.LO2012★ 2 cited
Randomness, pseudorandomness and models of arithmetic
Pavel Pudlak
Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To t…