Abstract
Recently, Williams [STOC ’14] proved a separation between \(\mathsf {NEXP}\) and \(\mathsf {ACC}\circ \mathsf {THR}\), where an \(\mathsf {ACC}\circ \mathsf {THR}\) circuit has a single layer of threshold gates at the bottom and an \(\mathsf {ACC}\) circuit at the top. Two main ideas of his strategy are a closure property of circuit class and an algorithm for counting satisfying assignments of circuits.
In this paper, we show that this general scheme based on these two ideas can be applied for a certain class of circuits with multi layer of threshold gates. The circuit class we give has the symmetric gate at the top and poly-log layers of threshold gates to which an extra condition on the dependency is imposed. Two gates in a circuit are dependent, if the output of the one is always greater than or equal to the other one. An independent gate set is a set of gates in which two arbitrary gates are \(not\) dependent. We show that, if the size of a maximum independent gate set of each layer of threshold gates is at most \(n^{\gamma }\) for sufficiently small \(\gamma >0\), then two key ingredients needed to apply his strategy can be established. Namely, (i) we can efficiently find a circuit in our class being equivalent to the AND of two input circuits in our class, and (ii) we can construct a faster than brute-force algorithm for counting satisfying assignments for this class by introducing a partial order to represent the dependency of gates. As a result, we give super quasi-polynomial size lower bounds for our class against \(\mathsf {NEXP}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amano, K., Saito, A.: A satisfiability algorithm for some class of dense depth two threshold circuits, IEICE Trans. Inf. Sys., to appear
Beigel, R., Tarui, J.: On ACC. Computational Complexity 4, 350–366 (1994)
Coppersmith, D.: Rapid multiplication of rectangular matrices. SIAM J. Comput. 11(3), 467–471 (1982)
Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial time hierarchy. Mathematical Systems Theory 17, 13–27 (1984)
Hajnal, A., Maass, W., Pudlak, P., Szegedy, M., Turan, G.: Threshold circuits of bounded depth. In: FOCS 1987, pp. 99–110 (1987)
Håstad, J.: Almost optimal lower bounds for small depth circuits. Advances in Computing Research 5, 143–170 (1989)
Impagliazzo, R., Kabanets, V., Wigderson, A.: In search of an easy witness: exponential time versus probabilistic polynomial time. J. Comput. and Sys. Sci. 65(4), 672–694 (2002)
Impagliazzo, R., Paturi, R., Saks, M.E.: Size-depth tradeoffs for threshold circuits. SIAM J. Comput. 26(3), 693–707 (1997)
Iwama, K., Morizumi, H.: An explicit lower bound of 5\(n\)-\(o\)(\(n\)) for boolean circuits. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 353–364. Springer, Heidelberg (2002)
Razborov, A.: Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mathematical Notes of Academy of Sciences USSR 41(4), 598–607 (1987)
Smolensky, R.: Algebraic methods in the theory of lower bounds for boolean circuit complexity. In: STOC 1987, pp. 77–82 (1987)
Williams, R.: Improving exhaustive search implies superpolynomial lower bounds. In: STOC 2010, pp. 231–240 (2010)
Williams, R.: New algorithms and lower bounds for circuits with linear threshold gates. In: STOC 2014, pp. 194–102 (2014)
Williams, R.: Non-uniform ACC circuit lower bounds. Journal of the ACM 61(1), Article 22 (January 2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Amano, K., Saito, A. (2015). A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-15579-1_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15578-4
Online ISBN: 978-3-319-15579-1
eBook Packages: Computer ScienceComputer Science (R0)