The complexity of symmetric functions in bounded-depth circuits (Q1107989): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| 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.1016/0020-0190(87)90163-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974288421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Properties of complexity measures for PRAMs and WRAMs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounded-depth, polynomial-size circuits for symmetric functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:46, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of symmetric functions in bounded-depth circuits |
scientific article |
Statements
The complexity of symmetric functions in bounded-depth circuits (English)
0 references
1987
0 references
bounded-depth circuit
0 references
combinatorial complexity measure
0 references
sensitive complexity
0 references
symmetric functions
0 references
