Search Results

Given a circuit C : {0,1}^n → {0,1}^m from a circuit class 𝒞, with m > n, finding a y ∈ {0,1}^m such that ∀ x ∈ {0,1}ⁿ, C(x) ≠ y, is the range avoidance problem (denoted by C-Avoid). Deterministic polynomial time algorithms (even with access to NP oracles) solving this problem are known to imply explicit constructions of various pseudorandom objects like hard Boolean functions, linear codes, PRGs etc. Deterministic polynomial time algorithms are known for NC⁰₂-Avoid when m > n, and for NC⁰₃-Avoid when m ≥ n²/log n, where NC⁰_k is the class of circuits with bounded fan-in which have constant depth and the output depends on at most k of the input bits. On the other hand, it is also known that NC⁰₃-Avoid when m = n+O(n^{2/3}) is at least as hard as explicit construction of rigid matrices. In fact, algorithms for solving range avoidance for even NC⁰₄ circuits imply new circuit lower bounds. In this paper, we propose a new approach to solving the range avoidance problem via hypergraphs. We formulate the problem in terms of Turan-type problems in hypergraphs of the following kind: for a fixed k-uniform hypergraph H, what is the maximum number of edges that can exist in H_C, which does not have a sub-hypergraph isomorphic to H? We show the following: - We first demonstrate the applicability of this approach by showing alternate proofs of some of the known results for the range avoidance problem using this framework. - We then use our approach to show (using several different hypergraph structures for which Turan-type bounds are known in the literature) that there is a constant c such that Monotone-NC⁰₃-Avoid can be solved in deterministic polynomial time when m > cn². - To improve the stretch constraint to linear, more precisely, to m > n, we show a new Turan-type theorem for a hypergraph structure (which we call the loose X_{2ℓ}-cycles). More specifically, we prove that any connected 3-uniform linear hypergraph with m > n edges must contain a loose X_{2ℓ} cycle. This may be of independent interest. - Using this, we show that Monotone-NC⁰₃-Avoid can be solved in deterministic polynomial time when m > n, thus improving the known bounds of NC⁰₃-Avoid for the case of monotone circuits. In contrast, we note that efficient algorithms for solving Monotone-NC⁰₆-Avoid, already imply explicit constructions for rigid matrices. - We also generalise our argument to solve the special case of range avoidance for NC⁰_k where each output function computed by the circuit is the majority function on its inputs, where m > n².