Parity, circuits, and the polynomial-time hierarchy (Q3318683): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PAL-11A / rank | |||
Normal rank | |||
Revision as of 04:35, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parity, circuits, and the polynomial-time hierarchy |
scientific article |
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
