On the complexity of planar Boolean circuits (Q1842774): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:45, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of planar Boolean circuits |
scientific article |
Statements
On the complexity of planar Boolean circuits (English)
0 references
19 July 1995
0 references
planar graphs
0 references
planar circuits
0 references
circuit complexity
0 references
