A Gödel Theorem on Network Complexity Lower Bounds (Q3708019)
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 3933068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Gödel Theorem on Network Complexity Lower Bounds |
scientific article; zbMATH DE number 3933068 |
Statements
A Gödel Theorem on Network Complexity Lower Bounds (English)
0 references
1986
0 references
incompleteness
0 references
lower complexity bounds
0 references
Boolean functions
0 references
minimal proof length
0 references
formal proof system
0 references
0.7799445986747742
0 references
0.7554668188095093
0 references