A note on the relation between polynomial time functionals and Constable's class K

DOI10.1007/3-540-61377-3_36zbMATH Open1540.68097MaRDI QIDQ6560166FDOQ6560166

Authors: Peter Clote 

Publication date: 21 June 2024

Recommendations

• Publication:4934292
• scientific article; zbMATH DE number 4112573
• scientific article; zbMATH DE number 65741
• Some applications of logic to feasibility in higher types
• Safe Weak Minimization Revisited

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Paths, Trees, and Flowers
• On uniformity within \(NC^ 1\)
• RelativizedNC
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Boolean Functions, Invariance Groups, and Parallel Complexity
• Arithmetizing uniform \(NC\)
• Title not available (Why is that?)
• Polynomial and abstract subrecursive classes
• Title not available (Why is that?)
• Classes of Predictably Computable Functions
• Complexity for type-2 relations
• A recursive and a grammatical characterization of the exponential-time languages
• Title not available (Why is that?)
• Subrecursiveness: Machine-independent notions of computability in restricted time and storage
• Title not available (Why is that?)

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)