Theory and Applications of Models of Computation
From MaRDI portal
Publication:5898890
DOI10.1007/11750321zbMath1178.68286OpenAlexW4296156427MaRDI QIDQ5898890
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
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Computational complexity of counting problems on 3-regular planar graphs ⋮ Picturing Counting Reductions with the ZH-Calculus ⋮ The complexity of Bayesian networks specified by propositional and relational languages
This page was built for publication: Theory and Applications of Models of Computation
