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

DOI10.1016/S0304-3975(99)00121-8zbMATH Open0952.68064MaRDI QIDQ1589424FDOQ1589424

Authors: Wolfgang Merkle 

Publication date: 12 December 2000

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

Recommendations

• scientific article; zbMATH DE number 4126690
• scientific article; zbMATH DE number 515727
• Structure in Approximation Classes
• Logical definability of NP optimization problems
• Lattice embeddings for abstract bounded reducibilities

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

• Optimization, approximation, and complexity classes
• The recursion-theoretic structure of complexity classes
• On the Structure of Polynomial Time Reducibility
• Sublattices of the polynomial time degrees
• Completeness in approximation classes
• On Syntactic versus Computational Views of Approximability
• Title not available (Why is that?)
• Polynomial and abstract subrecursive classes
• An observation on probability versus randomness with applications to complexity classes
• On the structure of sets in NP and other complexity classes
• A uniform approach to obtain diagonal sets in complexity classes
• Minimal pairs for P
• Lattice embeddings for abstract bounded reducibilities
• Title not available (Why is that?)

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

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