Holographic reduction, interpolation and hardness (Q1926111): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00037-012-0044-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064541898 / 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: The complexity of partition functions / 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: From Holant to #CSP and Back: Dichotomy for Holant c Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions / 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: On symmetric signatures in holographic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms: from art to science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Holant Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational proof of complexity of some restricted counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the permanent of graphs with large factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting homomorphisms to directed acyclic graphs / 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: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / 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: Dimer problem in statistical mechanics-an exact result / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of counting problems on 3-regular planar graphs / rank
 
Normal rank

Latest revision as of 01:10, 6 July 2024

scientific article
Language Label Description Also known as
English
Holographic reduction, interpolation and hardness
scientific article

    Statements

    Holographic reduction, interpolation and hardness (English)
    0 references
    0 references
    0 references
    0 references
    27 December 2012
    0 references
    holographic reduction
    0 references
    polynomial interpolation
    0 references
    P-hard
    0 references
    counting complexity
    0 references
    0 references
    0 references

    Identifiers