Number of the records: 1
Complexity of computations and proofs
- 1.PUDLÁK, Pavel, RÖDL, V. Pseudorandom sets and explicit constructions of Ramsey graphs. In: KRAJÍČEK, J., ed. Complexity of computations and proofs. Napoli: Dipartimento di Matematica della Seconda Universita di Napoli, 2004, s. 327-346. Quaderni di matematica, 13. ISBN 88-7999-413-1.
Number of the records: 1