scientific article
From MaRDI portal
Publication:3852167
zbMath0419.03023MaRDI QIDQ3852167
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Subsystems of classical logic (including intuitionistic logic) (03B20) Turing machines and related notions (03D10)
Related Items (2)
Ein Modell des P=NP-Problems mit einer positiven Lösung ⋮ Complex Boolean networks obtained by diagonalization
This page was built for publication: