Log in

Normal view MARC view ISBD view

Randomness and Completeness in Computational Complexity

By: Melkebeek, Dieter van.

Material type: materialTypeLabel

materialTypeLabel

BookSeries: 1950. Lecture notes in computer science.Publisher: Berlin: Springer, 2004Description: xi, 196 p.; ill.: 23 cm.ISBN: 3540414924 .Subject(s): Computational complexity | Computer science - Mathematics | Betting game | circuit | Goldreich-Levin | randomized algorithm | turing machineDDC classification: 004

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings ( 1 )
Comments ( 0 )

Item type	Current location	Call number	Status	Date due	Barcode
Books		004 MEL (Browse shelf)	Available		011944

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha