Holographic Algorithms: The Power of Dimensionality Resolved

DOI10.1007/978-3-540-73420-8_55MaRDI QIDQ5428845zbMATH OpenOpenAlexFDO

Authors Jin-Yi Cai, Pinyan Lu

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_55

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Holographic algorithms: the power of dimensionality resolved
• Holographic algorithms
• Holographic algorithms: from art to science
• Holographic algorithms: from art to science
• Basis collapse in holographic algorithms

Cited in

(11)

• Holographic algorithms: the power of dimensionality resolved
• Holographic algorithms without matchgates
• Evaluations of Tutte polynomials of regular graphs
• Counting degree-constrained subgraphs and orientations
• Valiant's holant theorem and matchgate tensors
• Holographic algorithms
• A collapse theorem for holographic algorithms with matchgates on domain size at most 4
• \(P\) versus \(NP\) and geometry
• Signature theory in holographic algorithms
• On the theory of matchgate computations
• On symmetric signatures in holographic algorithms

This page was built for publication: Holographic Algorithms: The Power of Dimensionality Resolved

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428845)