Theory and Applications of Models of Computation

DOI10.1007/11750321zbMath1178.68660OpenAlexW4296156427MaRDI QIDQ5898880

Jin-Yi Cai, Vinay Choudhary

Publication date: 30 April 2007

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

Full work available at URL: https://doi.org/10.1007/11750321

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (7)

Computational complexity of counting problems on 3-regular planar graphs ⋮ \(P\) versus \(NP\) and geometry ⋮ Holographic algorithms without matchgates ⋮ Signature theory in holographic algorithms ⋮ Computing the Tutte polynomial of lattice path matroids using determinantal circuits ⋮ On symmetric signatures in holographic algorithms ⋮ Holographic algorithms: the power of dimensionality resolved

This page was built for publication: Theory and Applications of Models of Computation