Media type: Book; Thesis Title: Randomness and completeness in computational complexity Contributor: Melkebeek, Dieter van [Author] imprint: Berlin; Heidelberg [u.a.]: Springer, 2000 Published in: Lecture notes in computer science ; 1950 Extent: XV, 196 S.; graph. Darst; 24 cm Language: English ISBN: 3540414924 RVK notation: SS 4800 : Lecture notes in computer science Keywords: Berechnungskomplexität NP-vollständiges Problem P-vollständiges Problem Berechnungskomplexität > Randomisierung Berechnungskomplexität NP-vollständiges Problem P-vollständiges Problem Berechnungskomplexität > Randomisierung Origination: University thesis: Überarb. zugl.: Chicago, Ill., Univ., Diss. Footnote:
Departmental Library DrePunct – stack Shelf-mark: R2016 8 5079 Item ID: 30082058 Status: Loanable, place order > Ordering possible ‒ please log in Orders received from Mon - Fri by 1 pm are expected to be ready for you on the same day.