 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen  [1]
|
Hilfe 
|
 |
|
| Suche: Citkey="Chakrabarti-Khot/01" |
|
Improved lower bounds on the randomized complexity of graph properties
Amit Chakrabarti, Subhash Khot
Proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP'2001 (Crete, Greece, July 8-12, 2001)
Lecture Notes in Computer Science
2076
, 2001, pp. 285-296
| Editors | Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen | |
| Publisher: | Springer-Verlag | |
| Address: | Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo | |
| Keywords: | decision tree complexity, monotone graph properties, randomized complexity, randomized algorithms, graph packing, probabilistic method | |
| URL: |
http://springerlink.metapress.com/openurl.asp?genre=article&id=1D44C1YP73W2Y287 | |
|
|
|
|