A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6375061 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123157085 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1305.1409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324796 / 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: Holographic Algorithms: The Power of Dimensionality Resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549638 / 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: Graph Homomorphisms with Complex Values: A Dichotomy Theorem / 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: Gadgets and anti-gadgets leading to a complexity dichotomy / 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: Spin systems on \(k\)-regular graphs with complex edge functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Dichotomy for the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms on bases of rank 2 / 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: The Complexity of Symmetric Boolean Parity Holant Problems / 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: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completeness of the first-order functional calculus / 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: Quantum computers that can be simulated classically in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Observations on Holographic Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:36, 9 July 2024

scientific article
Language Label Description Also known as
English
A collapse theorem for holographic algorithms with matchgates on domain size at most 4
scientific article

    Statements

    A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (English)
    0 references
    0 references
    0 references
    28 November 2014
    0 references

    Identifiers