scientific article
From MaRDI portal
Publication:3478393
zbMath0701.03017MaRDI QIDQ3478393
Anil Nerode, Jeffery B. Remmel
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive equivalence types of sets and structures, isols (03D50)
Related Items
Definable Subsets of Polynomial-Time Algebraic Structures, On the lattices of NP-subspaces of a polynomial time vector space over a finite field, Polynomial-time axioms of choice and polynomial-time cardinality, Cancellation laws for polynomial-time \(p\)-isolated sets, Polynomial-time analogues of isolatedness, The back-and-forth method and computability without delay, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, Computable embeddability for algebraic structures
