Feasible graphs with standard universe

DOI10.1016/S0168-0072(97)00064-XzbMath0938.03065OpenAlexW1990994850MaRDI QIDQ1295403

Douglas Cenzer, Jeffery B. Remmel

Publication date: 14 June 2000

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(97)00064-x

zbMATH Keywords

isomorphism problemrecursive treerecursive isomorphismcomputable treesrecursive graphsp-time modelsrecursive equivalence relation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Complexity of computation (including implicit computational complexity) (03D15) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

Complexity and categoricity

Cites Work

• Complexity-theoretic algebra. II: Boolean algebras
• Polynomial-time versus recursive models
• Polynomial-time Abelian groups
• Recursively presented games and strategies
• Classical recursion theory. Vol. II
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Feasible Graphs and Colorings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item