adicionar à lista de desejos
Theory Of Semi-Feasible Algorithms
language: english
Publisher:
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG, October of 2002 ‧
see product details
SYNOPSIS
This text presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness and NP-hardness.
DETAILS
| Property | Description |
|---|---|
| ISBN: | 9783540422006 |
| Publisher: | SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Release Date: | October of 2002 |
| Language: | English |
| Cover: | Hardcover |
| Pages: | 150 |
| Format: | Book |
| Categories: |
Books in English
>
Computing
>
Schedule
Books in English > Computing > Database |
| EAN: | 9783540422006 |