Parity, circuits, and the polynomial-time hierarchy (Q3318683)
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 3849129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parity, circuits, and the polynomial-time hierarchy |
scientific article; zbMATH DE number 3849129 |
Statements
Parity, circuits, and the polynomial-time hierarchy (English)
0 references
1984
0 references
Boolean circuits
0 references
lower bound
0 references
parity function
0 references
multiplication
0 references
transitive closure
0 references
polynomial-time hierarchy
0 references
0 references
0.83992994
0 references
0.8369864
0 references
0.8360082
0 references
0.83200085
0 references
0.83094275
0 references
0.82757115
0 references
0.8251574
0 references
0.82493395
0 references
