Completeness and reduction in algebraic complexity theory
Material type:
TextSeries: Algorithms and Computation in Mathematics ; v.7Publication details: Berlin Springer-Verlag 2000Description: xii, 168p. Bibl. IndexISBN: - 3540667520
- 511.5 B956.CR
| Item type | Current library | Call number | Status | Notes | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Book
|
ISID | 511.5 B956.CR (Browse shelf(Opens below)) | Available | Ord num:6019; Ord dt:2001-01-11 | DP24520 |
Browsing ISID shelves Close shelf browser (Hides shelf browser)
| No cover image available |
|
|
|
No cover image available | No cover image available | No cover image available | ||
| 511.5 B711.GT Graph theory with applications / | 511.5 B711.GT Graph theory / | 511.5 B956.AC Algebraic complexity theory | 511.5 B956.CR Completeness and reduction in algebraic complexity theory | 511.5 C182.DG Designs, graphs, codes and their links | 511.5 C182.GC Graphs, codes and designs | 511.5 C431.AG Applications of graph theory algorrithms / |
There are no comments on this title.
Log in to your account to post a comment.
