Skip to content
Texas A&M University Libraries
  • MyLibrary
  • Help

Libraries Catalog

Advanced
  • Randomness and completeness in...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Cover Image

Randomness and completeness in computational complexity /

Bibliographic Details
Main Author: Melkebeek, Dieter van
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin ; New York : Springer-Verlag, [2000]
Series:Lecture notes in computer science ; 1950.
Subjects:
Computer science > Mathematics.
Computational complexity.
aléatoire.
hasard.
bruit blanc.
complexité calcul.
complétude.
Informatique > Mathématiques.
Complexité de calcul (Informatique)
Complexité de calcul (informatique)
Berechnungskomplexität.
NP-vollständiges Problem.
P-vollständiges Problem.
Randomisierung.
Electronic books.
Online Access:Connect to the full text of this electronic book
  • Holdings
  • Description
  • Table of Contents
  • Similar Items
  • Staff View

Internet

Connect to the full text of this electronic book

Remote Storage

Holdings details from Remote Storage
Call Number: QA76.9.M35 M54 2000
 
Call Number Status Get It
QA76.9.M35 M54 2000 Available
  • howdy.tamu.edu
  • Off-Campus Access
  • Texas A&M University
  • Site Policies
  • Accessibility
  • Texas CREWS
  • Comments
  • Services Status
Loading...