scientific article
From MaRDI portal
Publication:3484825
zbMath0705.03024MaRDI QIDQ3484825
Anil Nerode, Jeffery B. Remmel
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cancellationclosureisolrecursive equivalence typespolynomial time equivalence typeinfinite p-time setsp- isolated setsp-finite sets
Complexity of computation (including implicit computational complexity) (03D15) Recursive equivalence types of sets and structures, isols (03D50)
Related Items
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
