Pages that link to "Item:Q1107309"
From MaRDI portal
The following pages link to The complexity of optimization problems (Q1107309):
Displaying 50 items.
- The complexity of computing maximal word functions (Q1321032) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- The complexity of optimizing finite-state transducers (Q1329734) (← links)
- Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
- Universally serializable computation (Q1384538) (← links)
- Studying the complexity of global verification for NP-hard discrete optimization problems (Q1402543) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- The complexity of belief update (Q1575185) (← links)
- Some structural properties of SAT (Q1587336) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- Some new results in the complexity of allocation and binding in data path synthesis (Q1608404) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking (Q1783933) (← links)
- The complexity of error metrics (Q1799556) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- On the power of unambiguity in log-space (Q1926109) (← links)
- Non-uniform reductions (Q1959376) (← links)
- Two queries (Q1961371) (← links)
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP (Q1962023) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- A nondeterministic Turing machine variant to compute functions (Q2067632) (← links)
- Choice logics and their computational properties (Q2082503) (← links)
- The variational quantum eigensolver: a review of methods and best practices (Q2092477) (← links)
- On the complexity of validity degrees in Łukasiewicz logic (Q2106603) (← links)
- Timed negotiations (Q2200811) (← links)
- Computing homotopic line simplification (Q2249045) (← links)
- Monodirectional P systems (Q2311264) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- From causes for database queries to repairs and model-based diagnosis and back (Q2402617) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Consistency checking and querying in probabilistic databases under integrity constraints (Q2453564) (← links)
- Proving SAT does not have small circuits with an application to the two queries problem (Q2475408) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q2670923) (← links)
- The complexity of comparing optimal solutions (Q2671811) (← links)
- Complexity of manipulative interference in participatory budgeting (Q2695465) (← links)
- Complexity and approximability of quantified and stochastic constraint satisfaction problems (Q2741527) (← links)
- Preimage Problems for Reaction Systems (Q2799204) (← links)
- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT (Q2818016) (← links)
- On the Complexity of Master Problems (Q2946425) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks (Q3075529) (← links)
- (Q3132650) (← links)
