scientific article; zbMATH DE number 4148067

zbMATH Open0701.03017MaRDI QIDQ3478393FDOQ3478393

Authors: Jeffrey Remmel, Anil Nerode 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

polynomial time equivalence type

Mathematics Subject Classification ID

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

Cited In (11)

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

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)