Given an integer $ k $ and a graph where every edge is colored either red or blue, the goal
of the exact matching problem is to find a perfect matching with the property that exactly $ k …

In 1982 Papadimitriou and Yannakakis introduced the Exact Matching problem, in which
given a red and blue edge-colored graph $ G $ and an integer $ k $ one has to decide …

In the Exact Matching problem, we are given a graph whose edges are colored red or blue
and the task is to decide for a given integer k, if there is a perfect matching with exactly k red …

Determining the satisfiability of Boolean constraint-satisfaction problems with different types
of constraints, that is hybrid constraints, is a well-studied problem with important …

Weighted model counting (# SAT) has recently been shown to deliver a promising new
method for tackling core problems in quantum circuit analysis. However, the development of …

Greenberger-Horne-Zeilinger (GHZ) states are quantum states involving at least three
entangled particles. They are of fundamental interest in quantum information theory, and the …

This thesis deals with graph problems that are solvable in randomized polynomial time but
no deterministic algorithm exists for them. The central problem we focus on is the Exact …