A Gödel Theorem on Network Complexity Lower Bounds (Q3708019): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Claus Peter Schnorr / rank | |||
Property / author | |||
Property / author: Claus Peter Schnorr / rank | |||
Normal rank | |||
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.1002/malq.19860321912 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978889713 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:23, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Gödel Theorem on Network Complexity Lower Bounds |
scientific article |
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