Holographic algorithms on domain size k > 2

DOI10.1007/978-3-642-29952-0_35MaRDI QIDQ2898045zbMATH OpenOpenAlexFDO

Authors Zhiguo Fu, Jin-Yi Cai

Publication date 16 July 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29952-0_35

zbMATH Keywords

holographic algorithmsmatchgatessimultaneous realizability problem

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01) Nonnumerical algorithms (68W05)

Recommendations

• Holographic algorithms on bases of rank 2
• Basis collapse for holographic algorithms over all domain sizes
• Holographic algorithms: from art to science
• Holographic algorithms: from art to science
• Signature theory in holographic algorithms

Cited in

(5)

• Holographic algorithms on bases of rank 2
• Nearly-linear size holographic proofs
• A collapse theorem for holographic algorithms with matchgates on domain size at most 4
• Basis collapse for holographic algorithms over all domain sizes
• Holographic algorithms on domains of general size

This page was built for publication: Holographic algorithms on domain size \(k > 2\)

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