Pages that link to "Item:Q1342522"
From MaRDI portal
The following pages link to Logical definability of NP optimization problems (Q1342522):
Displayed 20 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- On input read-modes of alternating Turing machines (Q672377) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- A note on the approximation of the MAX CLIQUE problem (Q1183423) (← links)
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap (Q2868930) (← links)
- Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
- On the approximability of the maximum common subgraph problem (Q5096796) (← links)
- (Q5216300) (← links)
- Approximating minimum keys and optimal substructure screens (Q6184674) (← links)