No label defined (Q3822100)
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 4095386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4095386 |
Statements
1987
0 references
monotone complexity
0 references
monotone Boolean functions
0 references
Turing complexity
0 references
0.9427813
0 references
0.9427024
0 references
0.9399103
0 references
0.9208839
0 references
0.9181474
0 references
[For the entire collection see Zbl 0657.00005.] This is a survey of lower bounds obtained in the last two years for the monotone complexity of certain classes of monotone Boolean functions; a few older results are also included. The connection with the Turing complexity of the associated languages is pointed out. Four open problems are stated.
0 references