Generalized counting constraint satisfaction problems with determinantal circuits (Q472444): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorical quantum circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice path matroids: Enumerative aspects and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Path Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of counting CSP with complex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial Laplacian with vertex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of tensor calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of tensor calculus. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traced monoidal categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an algebraic theory of Boolean circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms without matchgates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief propagation in monoidal categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Tutte polynomial of lattice path matroids using determinantal circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Complexity Theory I: An Approach to the<i>P</i>vs.<i>NP</i>and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Circuits That Can Be Simulated Classically in Polynomial Time / rank
 
Normal rank

Latest revision as of 07:18, 9 July 2024

scientific article
Language Label Description Also known as
English
Generalized counting constraint satisfaction problems with determinantal circuits
scientific article

    Statements

    Generalized counting constraint satisfaction problems with determinantal circuits (English)
    0 references
    0 references
    0 references
    19 November 2014
    0 references
    counting complexity
    0 references
    tensor network
    0 references
    monoidal categories
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references