No article text was recorded for this version.
complexity classification
Version 1 of 163 papers104 conceptsfrozen 2026-10-04
Papers in this version
- Blog: From Holant to #CSP and Back: Dichotomy for Holant c Problems
- Blog: Equivalence and Isomorphism for Boolean Constraint Satisfaction
- Blog: On Minimum Representations of Matched Formulas (Extended Abstract)
- Blog: Counting Homomorphisms and Partition Functions
- Blog: Graph Homomorphisms with Complex Values: A Dichotomy Theorem
- Blog: Dichotomy for Real Holantc Problems
- Blog: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
- Blog: 09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability
- Blog: The Complexity of Weighted Boolean #CSP Modulo k
- Blog: From Holant to #CSP and Back: Dichotomy for Holantc Problems
- Blog: On the Complexity of Holant Problems
- Blog: 06401 Abstracts Collection - Complexity of Constraints
- Blog: Constraint Satisfaction, Databases, and Logic
- Blog: Network Satisfaction for Symmetric Relation Algebras with a Flexible Atom
- Blog: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP
- Blog: Counting Homomorphisms and Partition Functions
- Blog: Solving Infinite-Domain CSPs Using the Patchwork Property
- Blog: Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
- Blog: On Tractable Exponential Sums
- Blog: Generalised k-variable-mixed-polarity Reed–Muller expansions for system of Boolean functions and their minimisation
- Blog: Editorial: ISAAC 2008 Special Issue
- Blog: Insight into Voting Problem Complexity Using Randomized Classes
- Blog: The Complexity of Boolean Constraint Isomorphism
- Blog: On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
- Blog: The Complexity of Computing Minimal Unidirectional Covering Sets
- Blog: The Data Complexity of Description Logic Ontologies
- Blog: A Dichotomy for 2-Constraint Forbidden CSP Patterns
- Blog: New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching
- Blog: Complexity of Local Search for CSPs Parameterized by Constraint Difference
- Blog: The complexity of approximating conservative counting CSPs
- Blog: Sketching Approximability of All Finite CSPs
- Blog: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
- Blog: On the Subexponential-Time Complexity of CSP
- Blog: FPTAS for Counting Monotone CNF
- Blog: Matchgate signatures under variable permutations
- Blog: Dichotomy for Holant* Problems with a Function on Domain Size 3
- Blog: Hardness of learning DNFs using halfspaces
- Blog: Answer Counting Under Guarded TGDs
- Blog: On the Containment Problem for Linear Sets
- Blog: On Tractable Exponential Sums
- Blog: Decipherment Complexity in 1: 1 Substitution Ciphers
- Blog: On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits
- Blog: Enumerating Homomorphisms
- Blog: Approximability of the Eight-vertex Model
- Blog: Tally NP Sets and Easy Census Functions
- Blog: The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem)
- Blog: Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
- Blog: Complexity of Restricted Variants of Skolem and Related Problems
- Blog: FPTAS for Weighted Fibonacci Gates and Its Applications
- Blog: Correlation Decay and Tractability of CSPs
- Blog: Minimization for Generalized Boolean Formulas
- Blog: List Covering of Regular Multigraphs with Semi-edges
- Blog: A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
- Blog: Graph Homomorphisms with Complex Values: A Dichotomy Theorem
- Blog: The complexity of binary matrix completion under diameter constraints
- Blog: The Complexity of Non-Monotone Markets
- Blog: A complexity dichotomy for partition functions with mixed signs
- Blog: What's Hot in Constraint Programming
- Blog: Binary Matrix Completion Under Diameter Constraints
- Blog: The Complexity of Ferromagnetic Two-spin Systems with External Fields
Showing 60 of 63 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_complexity_classification_d0ec8ca0,
title = {complexity classification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/complexity-classification/rdr_d0ec8ca0d92348529aacaacd212bc5a2},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_complexity_classification_d0ec8ca0_v1,
title = {complexity classification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/complexity-classification/rdr_d0ec8ca0d92348529aacaacd212bc5a2/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}