P-uniform circuit complexity (Q3474881)
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 4143426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | P-uniform circuit complexity |
scientific article; zbMATH DE number 4143426 |
Statements
P-uniform circuit complexity (English)
0 references
1989
0 references
bounded-action devices
0 references
alternation and nondeterminism
0 references
complexity hierarchies
0 references
reducibility and completeness
0 references
alternating Turing machine
0 references
auxiliary pushdown automata
0 references
exponential time
0 references
precomposition
0 references
sparse sets
0 references
tally sets
0 references
parallelism
0 references
0 references
0.89388484
0 references
0 references
0 references
0.8663071
0 references
0.8650704
0 references
0.86191094
0 references
0.8610973
0 references
