Parity Separation: A Scientifically Proven Method for Permanent Weight Loss

DOI 10.4230/LIPIcs.ICALP.2016.47</link>zbMath 1388.68221</link>arXiv 1511.07480</link>OpenAlex W2962964193</link>MaRDI QID Q4598186</link>

Radu Curticapean

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1511.07480

zbMATH Keywords

perfect matchingscounting complexitystructural complexityexponential-time hypothesis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Signed and weighted graphs (05C22)

Related Items (4)

Counting Solutions to Polynomial Systems via Reductions ⋮ Solution-Graphs of Boolean Formulas and Isomorphism ⋮ The Complexity of Homomorphism Indistinguishability ⋮ Solution-Graphs of Boolean Formulas and Isomorphism1

This page was built for publication: Parity Separation: A Scientifically Proven Method for Permanent Weight Loss