Generalized counting constraint satisfaction problems with determinantal circuits

Keyphrases

• Pfaffian 100%
• Counting Constraint Satisfaction Problem 100%
• Counting Problems 66%
• Monoidal Category 66%
• Polynomial-time Algorithm 33%
• Circuit-based 33%
• Planarity 33%
• Expressive Power 33%
• Quadratic Cost 33%
• Closed Timelike Curves 33%
• Quantum Circuit 33%
• Holant Problem 33%
• Skew-symmetric Matrix 33%
• Categorical Properties 33%
• Spanning Forest 33%
• Matchgates 33%
• Category Theory 33%
• Arbitrary Matrix 33%
• Algebraic Graph Theory 33%
• Tutte Polynomial 33%
• Matroid 33%
• #P-hard 33%
• Langland 33%

Computer Science

• Symmetric Matrix 50%
• Skew-Symmetric 50%
• Algebraic Graph Theory 50%

Mathematics

• Skew-Symmetric Matrix 33%
• Category Theory 33%
• Quantum Circuit 33%
• Expressive Power 33%