A note on the descriptive complexity of maximization problems

DOI10.1016/0020-0190(93)90151-XzbMath0778.68034OpenAlexW2052673159MaRDI QIDQ685495

Pierluigi Crescenzi, Riccardo Silvestri

Publication date: 13 January 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90151-x

zbMATH Keywords

optimization problemsdescriptive complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• A note on the approximation of the MAX CLIQUE problem
• Optimization, approximation, and complexity classes
• Approximation algorithms for combinatorial problems
• Logical definability of NP optimization problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the descriptive complexity of maximization problems