Monotonic and Non-Monotonic Solution Concepts for Generalized Circuits

07/30/2019
by   Steffen Schuldenzucker, et al.
0

Generalized circuits are an important tool in the study of the computational complexity of equilibrium approximation problems. However, in this paper, we reveal that they have a conceptual flaw, namely that the solution concept is not monotonic. By this we mean that if ε < ε', then an ε-approximate solution for a certain generalized circuit is not necessarily also an ε'-approximate solution. The reason for this non-monotonicity is the way Boolean operations are modeled. We illustrate that non-monotonicity creates subtle technical issues in prior work that require intricate additional arguments to circumvent. To eliminate this problem, we show that the Boolean gates are a redundant feature: one can simulate stronger, monotonic versions of the Boolean gates using the other gate types. Arguing at the level of these stronger Boolean gates eliminates all of the aforementioned issues in a natural way. We hope that our results will enable new studies of sub-classes of generalized circuits and enabler simpler and more natural reductions from generalized circuits to other equilibrium search problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2018

Investigating the Power of Circuits with MOD_6 Gates

We consider the power of Boolean circuits with MOD_6 gates. First, we in...
research
02/07/2018

On Synthesis of Reversible Circuits with Small Number of Additional Inputs Consisting of NOT, CNOT and 2-CNOT Gates

The paper discusses the gate complexity of reversible circuits with the ...
research
09/26/2019

On the complexity of the clone membership problem

We investigate the complexity of the Boolean clone membership problem (C...
research
08/16/2023

Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits

We explore the power of the unbounded Fan-Out gate and the Global Tunabl...
research
10/13/2022

Computing the Best Case Energy Complexity of Satisfying Assignments in Monotone Circuits

Measures of circuit complexity are usually analyzed to ensure the comput...
research
12/23/2020

Coin Flipping in Dynamic Programming is Almost Useless

We consider probabilistic circuits working over the real numbers, and us...
research
05/01/2022

Enumeration Classes Defined by Circuits

We refine the complexity landscape for enumeration problems by introduci...

Please sign up or login with your details

Forgot password? Click here to reset