Structural properties of bounded relations with an application to NP optimization problems

DOI10.1016/S0304-3975(99)00121-8zbMath0952.68064MaRDI QIDQ1589424

Wolfgang Merkle

Publication date: 12 December 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

lattice embeddingspartial order embeddingsabstract reducibilitiesapproximation preserving reducibilitiesnon-uniform reducibilitiesresource bounded reducibilities

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal pairs for P
• Completeness in approximation classes
• The recursion-theoretic structure of complexity classes
• On the structure of sets in NP and other complexity classes
• A uniform approach to obtain diagonal sets in complexity classes
• Optimization, approximation, and complexity classes
• Polynomial and abstract subrecursive classes
• Lattice Embeddings for Abstract Bounded Reducibilities
• Sublattices of the polynomial time degrees
• On the Structure of Polynomial Time Reducibility
• On Syntactic versus Computational Views of Approximability
• An observation on probability versus randomness with applications to complexity classes

This page was built for publication: Structural properties of bounded relations with an application to NP optimization problems