The following pages link to Quantifiers and approximation (Q1208413):
Displaying 11 items.
- On input read-modes of alternating Turing machines (Q672377) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- Optimal channel allocation for several types of cellular radio networks (Q1372738) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← 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)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- (Q2741527) (← links)
- Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap (Q2868930) (← links)
- Structure in approximation classes (Q6085751) (← links)
