Frameworks for logically classifying polynomial-time optimisation problems

DOI10.1007/978-3-642-13182-0_12zbMATH Open1285.90085OpenAlexW1566393034MaRDI QIDQ3569736FDOQ3569736

Authors: James Gate, Iain Stewart 

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/6483/1/6483.pdf

Recommendations

• Logical definability of NP optimization problems
• Syntactic characterizations of polynomial time optimization classes
• scientific article; zbMATH DE number 5499325
• Quantifiers and approximation
• scientific article; zbMATH DE number 515741

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Descriptive complexity and finite models (68Q19)

Cited In (2)

• Logical definability of NP optimization problems
• Title not available (Why is that?)

This page was built for publication: Frameworks for logically classifying polynomial-time optimisation problems

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