Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492883zbMATH OpenOpenAlexFDO

Authors André Hernich, Arfst Nickelsen

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11549345

zbMATH Keywords

structural complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Mathematical Foundations of Computer Science 2004
• One query reducibilities between partial information classes
• scientific article; zbMATH DE number 1848275
• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 4022646

Cited in

(7)

• The Power of Self-Reducibility: Selectivity, Information, and Approximation
• scientific article; zbMATH DE number 1834678 (Why is no real title available?)
• scientific article; zbMATH DE number 1848275 (Why is no real title available?)
• One query reducibilities between partial information classes
• Mathematical Foundations of Computer Science 2004
• Information Lower Bounds via Self-reducibility
• scientific article; zbMATH DE number 4096780 (Why is no real title available?)

This page was built for publication: Mathematical Foundations of Computer Science 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492883)