Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
Συγγραφείς: Ďuriš, PavolAff1, Hromkovič, JurajAff2, Rolim, José D. P.Aff3, Schnitger, GeorgAff4
Συνεισφορές: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Reischuk, Rüdiger, editor, Morvan, Michel, editor
Πηγή: STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings. 1200:117-128
Βάση Δεδομένων: Springer Nature eBooks
Περιγραφή
ISBN:9783540626169
9783540683421
DOI:10.1007/BFb0023453