scientific article

From MaRDI portal

Revision as of 12:06, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3762301

Jump to:navigation, search

zbMath0624.03033MaRDI QIDQ3762301

Kenneth W. Regan

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

topology recursive languages complexity classes many-one reducibility p-isomorphism incomparable pairs P-immune sets unprovably intractable languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

Diagonalization, uniformity, and fixed-point theorems ⋮ Minimum-complexity pairing functions

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3762301&oldid=17305093"