No label defined (Q3762226)
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 4012495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4012495 |
Statements
1987
0 references
computational complexity
0 references
Boolean formula
0 references
parallel computations
0 references
complexity of Boolean functions
0 references
computation models
0 references
Boolean circuits
0 references
minimization
0 references
combinational complexity
0 references
lower bound
0 references
circuit complexity
0 references
nonuniform complexity measures
0 references
Turing machines
0 references
monotone circuits
0 references
bounded-depth circuits
0 references
synchronous circuits
0 references
planar circuits
0 references
parallel random access machines
0 references
branching programs
0 references
0.97300386
0 references
0.9637826
0 references
0.9510425
0 references
0.9343091
0 references
0.9340861
0 references
0.9315816
0 references
0.9307287
0 references
