Pages that link to "Item:Q5402560"

The following pages link to The complexity of satisfiability problems (Q5402560):

Displaying 50 items.

• Backdoors to q-Horn (Q261394) (← links)
• Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
• Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Minimal and almost minimal reaction systems (Q272776) (← links)
• Traveling salesman problems in temporal graphs (Q284573) (← links)
• The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
• Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
• Complexity versus stability for classes of propositional formulas (Q293437) (← links)
• Generating all maximal models of a Boolean expression (Q294760) (← links)
• Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048) (← links)
• Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems (Q306491) (← links)
• Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
• A survey on single crane scheduling in automated storage/retrieval systems (Q323403) (← links)
• Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
• The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704) (← links)
• Complexity of coloring graphs without paths and cycles (Q344861) (← links)
• Belief revision within fragments of propositional logic (Q386044) (← links)
• Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
• Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
• The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
• The complexity of generalized domino tilings (Q396923) (← links)
• Bilevel programming and the separation problem (Q403662) (← links)
• Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (Q413279) (← links)
• On making directed graphs transitive (Q414917) (← links)
• Distance three labelings of trees (Q415278) (← links)
• New results for the longest haplotype reconstruction problem (Q423956) (← links)
• Influence of tree topology restrictions on the complexity of haplotyping with missing data (Q428852) (← links)
• Unification modulo homomorphic encryption (Q437037) (← links)
• The root location problem for arc-disjoint arborescences (Q442209) (← links)
• A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724) (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
• Complexity of partial satisfaction. II. (Q452481) (← links)
• Colouring, constraint satisfaction, and complexity (Q458466) (← links)
• Disjunctive closures for knowledge compilation (Q460617) (← links)
• On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
• Exact algorithms for Kayles (Q476858) (← links)
• Boolean max-co-clones (Q494629) (← links)
• A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695) (← links)
• The complexity of counting quantifiers on equality languages (Q515549) (← links)
• Exploring the complexity of the integer image problem in the \(\max\)-algebra (Q516821) (← links)
• Rigid binary relations on a 4-element domain (Q523155) (← links)
• Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
• A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (Q528481) (← links)
• Rule set design problems for oritatami systems (Q529023) (← links)
• Conjunctive query containment over trees (Q532363) (← links)
• The complexity of some acyclic improper colourings (Q533784) (← links)
• Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
• Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
• Public-key cryptographic system based on generalized satisfiability problem (Q549468) (← links)