P-uniform circuit complexity (Q3474881): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1058525 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Eric W. Allender / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/76359.76370 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2095274905 / rank | |||
Normal rank |
Latest revision as of 22:42, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | P-uniform circuit complexity |
scientific article |
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