Introduction to computational complexity. (Q4955547)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1453451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Introduction to computational complexity. |
scientific article; zbMATH DE number 1453451 |
Statements
28 May 2000
0 references
computational complexity
0 references
Boolean circuits
0 references
0.91254544
0 references
0 references
Introduction to computational complexity. (English)
0 references
The book represents a short introduction to some chapters in computational complexity. It includes computability theory, classical computational complexity, Boolean circuits, and a selection of advanced topics.
0 references
