The following pages link to (Q4298260):
Displayed 50 items.
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees (Q1612486) (← links)
- On the complexity of formulas in semantic programming (Q1615728) (← links)
- Node labels in local decision (Q1625609) (← links)
- Tree size reduction with keeping distinguishability (Q1630987) (← links)
- The computational complexity of calculating partition functions of optimal medians with Hamming distance (Q1631451) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Empirical analysis of algorithms for the shortest negative cost cycle problem (Q1634773) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- Computational complexity of the landscape. II: Cosmological considerations (Q1635657) (← links)
- Computation as social agency: what, how and who (Q1641025) (← links)
- The complexity of optimal multidimensional pricing for a unit-demand buyer (Q1651230) (← links)
- Self-concordance is NP-hard (Q1675557) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures (Q1679522) (← links)
- Algorithmically complex residually finite groups (Q1682244) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- Keeping logic in the trivium of computer science: a teaching perspective (Q1696593) (← links)
- The multi-stripe travelling salesman problem (Q1698268) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives (Q1706170) (← links)
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770) (← links)
- The intersection of subgroups in free groups and linear programming (Q1709789) (← links)
- Logical foundations of information disclosure in ontology-based data integration (Q1711879) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Linearly-growing reductions of Karp's 21 NP-complete problems (Q1713202) (← links)
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs (Q1729688) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- On the complexity of the Leibniz hierarchy (Q1740630) (← links)
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Intra- and interdiagram consistency checking of behavioral multiview models (Q1749133) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- Efficient approximation schemes for economic lot-sizing in continuous time (Q1751154) (← links)
- New genetic algorithm approach for the MIN-degree constrained minimum spanning tree (Q1751721) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Sparse selfreducible sets and nonuniform lower bounds (Q1755786) (← links)
- A faster pseudo-primality test (Q1758643) (← links)
- Efficient algorithms for heavy-tail analysis under interval uncertainty (Q1761865) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- On the generation of circuits and minimal forbidden sets (Q1769072) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Checking quasi-identities in a finite semigroup may be computationally hard. (Q1770618) (← links)
- Learning local transductions is hard (Q1770836) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)