A note on the relation between polynomial time functionals and Constable's class K
From MaRDI portal
Publication:6560166
Recommendations
Cites work
- scientific article; zbMATH DE number 440478 (Why is no real title available?)
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3936518 (Why is no real title available?)
- scientific article; zbMATH DE number 176199 (Why is no real title available?)
- scientific article; zbMATH DE number 3480091 (Why is no real title available?)
- scientific article; zbMATH DE number 3636006 (Why is no real title available?)
- scientific article; zbMATH DE number 806747 (Why is no real title available?)
- scientific article; zbMATH DE number 1390027 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 3105099 (Why is no real title available?)
- A recursive and a grammatical characterization of the exponential-time languages
- Arithmetizing uniform \(NC\)
- Boolean Functions, Invariance Groups, and Parallel Complexity
- Classes of Predictably Computable Functions
- Complexity for type-2 relations
- On uniformity within \(NC^ 1\)
- Paths, Trees, and Flowers
- Polynomial and abstract subrecursive classes
- RelativizedNC
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage
This page was built for publication: A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560166)