Pages that link to "Item:Q1107309"

The following pages link to The complexity of optimization problems (Q1107309):

Displaying 46 items.

• The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
• Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
• Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
• Weighted Boolean Formula Games (Q3464467) (← links)
• Complexity of Counting the Optimal Solutions (Q3511323) (← links)
• Counting Complexity of Minimal Cardinality and Minimal Weight Abduction (Q3532468) (← links)
• Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
• ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS (Q4007852) (← links)
• A survey of one-way functions in complexity theory (Q4009812) (← links)
• Structural analysis of the complexity of inverse functions (Q4032932) (← links)
• (Q4279211) (← links)
• Generalized theorems on relationships among reducibility notions to certain complexity classes (Q4298368) (← links)
• Complexity results for some eigenvector problems (Q4521209) (← links)
• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
• (Q4553280) (← links)
• Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
• Reasoning with Uncertain and Inconsistent OWL Ontologies (Q4647816) (← links)
• On computing Boolean connectives of characteristic functions (Q4835862) (← links)
• (Q4852904) (← links)
• Tailoring recursion for complexity (Q4858828) (← links)
• On the Complexity of Inverse Mixed Integer Linear Optimization (Q5013588) (← links)
• The operators min and max on the polynomial hierarchy (Q5047162) (← links)
• Resource-bounded kolmogorov complexity revisited (Q5047163) (← links)
• The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
• On the approximability of the maximum common subgraph problem (Q5096796) (← links)
• Dynamical Systems Theory and Algorithms for NP-hard Problems (Q5131680) (← links)
• The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
• (Q5148942) (← links)
• (Q5216300) (← links)
• SELF-SPECIFYING MACHINES (Q5249003) (← links)
• THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY (Q5249042) (← links)
• The 1-Versus-2 Queries Problem Revisited (Q5387752) (← links)
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
• ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
• (Q5875383) (← links)
• Theory and Applications of Models of Computation (Q5898889) (← links)
• The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
• Structure in approximation classes (Q6085751) (← links)
• Mixed Iterated Revisions: Rationale, Algorithms, and Complexity (Q6116365) (← links)
• The Complexity of Aggregates over Extractions by Regular Expressions (Q6135782) (← links)
• Taking into account ``who said what'' in abstract argumentation: complexity results (Q6161469) (← links)
• Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q6162056) (← links)
• Semiring reasoning frameworks in AI and their computational complexity (Q6488781) (← links)
• The MaxSAT problem in the real-valued MV-algebra (Q6541163) (← links)
• Lower bounds of functions on finite abelian groups (Q6591628) (← links)
• Weighted automata and logics meet computational complexity (Q6647756) (← links)