scientific article; zbMATH DE number 4012593

MaRDI QIDQ3762301zbMATH OpenFDO

Authors Kenneth W. Regan

Publication date 1986

zbMATH Keywords

complexity classesincomparable pairsmany-one reducibilityP-immune setsp-isomorphismrecursive languagestopologyunprovably intractable languages

Mathematics Subject Classification ID

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

Cited in

(9)

• Diagonalization, uniformity, and fixed-point theorems
• Minimum-complexity pairing functions
• Topological perspective on the hybrid proof rules
• scientific article; zbMATH DE number 3841832 (Why is no real title available?)
• scientific article; zbMATH DE number 3873308 (Why is no real title available?)
• scientific article; zbMATH DE number 3938569 (Why is no real title available?)
• scientific article; zbMATH DE number 4002078 (Why is no real title available?)
• scientific article; zbMATH DE number 3596249 (Why is no real title available?)
• Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)

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