scientific article; zbMATH DE number 4156426

MaRDI QIDQ3484825zbMATH OpenFDO

Authors Jeffrey Remmel, Anil Nerode

Publication date 1990

zbMATH Keywords

cancellationclosureinfinite p-time setsisolp- isolated setsp-finite setspolynomial time equivalence typerecursive equivalence types

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive equivalence types of sets and structures, isols (03D50)

Recommendations

• Polynomial-time analogues of isolatedness
• scientific article; zbMATH DE number 3869312
• Cancellation laws for polynomial-time \(p\)-isolated sets
• Publication:3487328
• Publication:3478393

Cited in

(8)

• Diagonalizations over polynomial time computable sets
• 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
• Sets of large dimension not containing polynomial configurations
• scientific article; zbMATH DE number 4148067 (Why is no real title available?)
• Polynomial-time axioms of choice and polynomial-time cardinality
• Polynomial time computations in models of ET

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 Q3484825)