The following pages link to (Q3221403):
Displayed 50 items.
- XML queries and constraints, containment and reformulation (Q555769) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- Searching in random partially ordered sets (Q596140) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- If NP has polynomial-size circuits, then MA=AM (Q674343) (← links)
- Stack size analysis for interrupt-driven programs (Q703848) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- The no-wait flow-shop paradox (Q813966) (← links)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system (Q814436) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- \(\text{DA}^2\) merging operators (Q814605) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- Games with winning conditions of high Borel complexity (Q817850) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360) (← links)
- Coloring some classes of mixed graphs (Q858294) (← links)
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438) (← links)
- Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- The complexity of membership problems for circuits over sets of integers (Q861262) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565) (← links)
- Expressiveness and complexity of graph logic (Q870359) (← links)
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation (Q881802) (← links)
- Jug measuring: algorithms and complexity (Q924133) (← links)
- Turing machines and bimachines (Q930927) (← links)
- Complexity of unique list colorability (Q935144) (← links)
- Reversal complexity revisited (Q935164) (← links)
- Computing the minimal covering set (Q943589) (← links)
- Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
- Computational complexity of determining which statements about causality hold in different space-time models (Q949614) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- Space complexity of abelian groups (Q1005925) (← links)
- The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete (Q1006641) (← links)
- A new connection between quantum circuits, graphs and the Ising partition function (Q1007123) (← links)
- On the subgroup distance problem. (Q1011736) (← links)
- The complexity of computing the Muirhead-Dalton distance (Q1013525) (← links)
- Quantum zero-error algorithms cannot be composed (Q1014398) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- The parallel complexity of signed graphs: Decidability results and an improved algorithm (Q1019708) (← links)
- Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices (Q1026186) (← links)