Number of the records: 1
Complexity of computations and proofs
- 1.
SYSNO 0021599 Title Pseudorandom sets and explicit constructions of Ramsey graphs Title Pseudonáhodné množiny a ramseyovské grafy Author(s) Pudlák, Pavel (MU-W) RID, SAI
Rödl, V. (US)Source Title Complexity of computations and proofs. s. 327-346. - Napoli : Dipartimento di Matematica della Seconda Universita di Napoli, 2004 / Krajíček J. ISBN 88-7999-413-1 Edition Quaderni di matematica Document Type Část monografie, knihy (kapitola) Grant IAA1019401 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR), CZ - Czech Republic CEZ AV0Z1019905 - MU-W Language eng Country IT Keywords ramsey graphs * explicit constructions Permanent Link http://hdl.handle.net/11104/0110538 File Download Size Commentary Version Access Pudlak1.pdf 1 273.1 KB Author´s preprint open-access
Number of the records: 1