scientific article; zbMATH DE number 4148067

MaRDI QIDQ3478393zbMATH OpenFDO

Authors Jeffrey Remmel, Anil Nerode

Publication date 1990

zbMATH Keywords

polynomial time equivalence type

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive equivalence types of sets and structures, isols (03D50) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Publication:3484825
• Polynomial-time analogues of isolatedness
• Elementary explicit types and polynomial time operations
• scientific article; zbMATH DE number 176202
• Cancellation laws for polynomial-time \(p\)-isolated sets

Cited in

(12)

• Cancellation laws for polynomial-time \(p\)-isolated sets
• Polynomial-time analogues of isolatedness
• On the lattices of NP-subspaces of a polynomial time vector space over a finite field
• The back-and-forth method and computability without delay
• scientific article; zbMATH DE number 4156426 (Why is no real title available?)
• scientific article; zbMATH DE number 176202 (Why is no real title available?)
• Definable Subsets of Polynomial-Time Algebraic Structures
• On the equivalence of types
• scientific article; zbMATH DE number 4197420 (Why is no real title available?)
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Computable embeddability for algebraic structures
• Polynomial-time axioms of choice and polynomial-time cardinality

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3478393)