Data representation and computational complexity
From MaRDI portal
Publication:1132872
Cites work
- A Classification of the Recursive Functions
- A Machine-Independent Theory of the Complexity of Recursive Functions
- scientific article; zbMATH DE number 3468805 (Why is no real title available?)
- scientific article; zbMATH DE number 3529421 (Why is no real title available?)
- scientific article; zbMATH DE number 3564953 (Why is no real title available?)
- scientific article; zbMATH DE number 3573847 (Why is no real title available?)
- scientific article; zbMATH DE number 3595170 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3324737 (Why is no real title available?)
- On the computational power of pushdown automata
- Primitiv-Rekursive Funktionen Über Einem Bereich Endlicher Mengen
- Rekursive Wortfunktionen
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Über die Verallgemeinerung der Theorie der Rekursiven Funktionen für Abstrakte Mengen Geeigneter Struktur als Definitionsbereiche
This page was built for publication: Data representation and computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132872)