2 citations · 4 across the 7 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.IT2013
Linear tree codes and the problem of explicit constructions
Pavel Pudlák
We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We…
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…