The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C31 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 12F10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6626045 / rank
 
Normal rank
Property / zbMATH Keywords
 
Tutte polynomial
Property / zbMATH Keywords: Tutte polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
medial graphs
Property / zbMATH Keywords: medial graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
Eulerian partitions
Property / zbMATH Keywords: Eulerian partitions / rank
 
Normal rank
Property / zbMATH Keywords
 
Puiseux series
Property / zbMATH Keywords: Puiseux series / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59474470 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2412274288 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.4020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of weighted Boolean \#CSP with mixed signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / 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: Towards a dichotomy theorem for 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: On Tractable Exponential Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Homomorphisms with Complex Values: A Dichotomy Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valiant's holant theorem and matchgate tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete dichotomy rises from the capture of vanishing signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spin systems on \(k\)-regular graphs with complex edge functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets and anti-gadgets leading to a complexity dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Holant Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic reduction, interpolation and hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for Holant Problems with a Function on Domain Size 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms by Fibonacci gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of complex weighted Boolean \#CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results for the Martin polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identities for circuit partition polynomials, with applications to the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness theorems for abelian varieties over number fields. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Dichotomy for Partition Functions with Mixed Signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of planar Boolean \#CSP with complex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor rank is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes on graphs: normal realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant Problems for Regular Graphs with Complex Edge Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating Quantum Computation by Contracting Tensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert's irreducibility theorem for prime degree and general polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5686123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Circuits That Can Be Simulated Classically in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le Polynôme De Martin D'un Graphe Eulerien / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Tutte Invariants for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantitative version of Runge's theorem on diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 13:15, 12 July 2024

scientific article
Language Label Description Also known as
English
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
scientific article

    Statements

    The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (English)
    0 references
    0 references
    0 references
    0 references
    9 September 2016
    0 references
    Tutte polynomial
    0 references
    medial graphs
    0 references
    Eulerian partitions
    0 references
    Puiseux series
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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