Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
Logical Definability of NP Optimization Problems
Home
Publications
Logical Definability of NP Optimization Problems
Logical Definability of NP Optimization Problems
PK
P.G. Kolaitis
P.G. Kolaitis
MT
M.N. Thakur
M.N. Thakur
Publisher Website
Google Scholar
Add to Library
Cite
Download
Share
Download
Download
Download PDF
Download
1 December 1994
journal article
Published by
Elsevier
in
Information and Computation
Vol. 115
(2)
,
321-353
https://doi.org/10.1006/inco.1994.1100
Abstract
No abstract available
Keywords
NP OPTIMIZATION PROBLEM
NP MAXIMIZATION PROBLEM
VARIOUS CLASS
LOGICAL DEFINABILITY
EXPRESSIVE POWER
LOGICAL DEFINABILITY STANDPOINT
NP MINIMIZATION PROBLEM
POLYNOMIALLY BOUNDED NP OPTIMIZATION
RELATIVE EXPRESSIVE POWER
OPTIMIZATION PROBLEM
LOGICAL DEFINIABILITY
FIRST ORDER
Cited by 51 articles