A note on the descriptive complexity of maximization problems
From MaRDI portal
Publication:685495
Recommendations
- Comparative versus quantitative truthlikeness definitions: Reply to Thomas Mormann
- scientific article; zbMATH DE number 1322635
- Probabilistic properties of approximation problems
- A general set theoretic approximation framework
- REASONING WITH FUZZY QUANTIFIED STATEMENTS: PART II
- On optimal approximations of arbitrary relations by partial orders
- Property-driven rough sets approximations of relations
- Approximations of arbitrary relations by partial orders
- scientific article; zbMATH DE number 4047069
- Local and Global Approximations for Incomplete Data
Cites work
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- A note on the approximation of the MAX CLIQUE problem
- Approximation algorithms for combinatorial problems
- Logical definability of NP optimization problems
- Optimization, approximation, and complexity classes
Cited in
(4)
This page was built for publication: A note on the descriptive complexity of maximization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685495)