Computing the Tutte polynomial of lattice path matroids using determinantal circuits (Q496045): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(9 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.07.042 / rank
Normal rank
 
Property / author
 
Property / author: Jacob M. Turner / rank
Normal rank
 
Property / author
 
Property / author: Jacob M. Turner / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6482907 / rank
 
Normal rank
Property / zbMATH Keywords
 
Tutte polynomial
Property / zbMATH Keywords: Tutte polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
quantum simulation
Property / zbMATH Keywords: quantum simulation / rank
 
Normal rank
Property / zbMATH Keywords
 
counting complexity
Property / zbMATH Keywords: counting complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
matroids
Property / zbMATH Keywords: matroids / rank
 
Normal rank
Property / zbMATH Keywords
 
tensor networks
Property / zbMATH Keywords: tensor networks / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1491410076 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.3537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial quantum algorithm for approximating the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor network methods for invariant theory / 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: Lattice path matroids: structural properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3633642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5198636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel kets, entangled states, and the location of quantum information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of tensor calculus. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchgates and classical simulation of quantum circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms without matchgates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip firing and the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutte polynomial for toric arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized counting constraint satisfaction problems with determinantal circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(h\)-vector of a lattice path matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spanning tree expansion of the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computers that can be simulated classically in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of matchgates. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028888 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.07.042 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:24, 9 December 2024

scientific article
Language Label Description Also known as
English
Computing the Tutte polynomial of lattice path matroids using determinantal circuits
scientific article

    Statements

    Computing the Tutte polynomial of lattice path matroids using determinantal circuits (English)
    0 references
    0 references
    0 references
    16 September 2015
    0 references
    Tutte polynomial
    0 references
    quantum simulation
    0 references
    counting complexity
    0 references
    matroids
    0 references
    tensor networks
    0 references

    Identifiers