Paweł M. Idziak
ABSTRACT
In [15] a generalization of Boolean circuits to arbitrary finite algebras had been introduced and applied to sketch P versus NP-complete borderline for circuits satisfiability over algebras from congruence modular varieties. However the problem for nilpotent (which had not been shown to be NP-hard) but not supernilpotent algebras (which had been shown to be polynomial time) remained open.
In this paper we provide a broad class of examples, lying in this grey area, and show that, under the Exponential Time Hypothesis and Strong Exponential Size Hypothesis (saying that Boolean circuits need exponentially many modular counting gates to produce boolean conjunctions of any arity), satisfiability over these algebras have intermediate complexity between ω(2c logh-1 n) and O(2c logh n), where h measures how much a nilpotent algebra fails to be supernilpotent. We also sketch how these examples could be used as paradigms to fill the nilpotent versus supernilpotent gap in general.
Our examples are striking in view of the natural strong connections between circuits satisfiability and Constraint Satisfaction Problem for which the dichotomy had been shown by Bulatov [4] and Zhuk [28].
- Erhard Aichinger and Nebojša Mudrinski, Some applications of higher commutators in Malcev algebras, Algebra Universalis, 63(2010), 367--403.Google Scholar
Cross Ref
- David A. Mix Barrington, Richard Beigel and Steven Rudich, Representing Boolean functions as polynomials modulo composite numbers, Computational Complexity, 4(1994), 367--382.Google ScholarDigital Library
- David A. Mix Barrington, Howard Straubing and Denis Thérien, Nonuniform automata over groups, Information and Computation, 89(1990), 109--132.Google Scholar
- Andrei Bulatov, A dichotomy theorem for nonuniform CSPs, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2017.Google ScholarCross Ref
- Andrei Bulatov, On the number of finite Mal'tsev algebras, Contributions to general algebra, 13(2000) 41--54.Google Scholar
- Ralph Freese and Ralph McKenzie, Commutator Theory for Congruence Modular Varieties, London Math. Soc. Lecture Notes, No. 125, Cambridge U. Press, Cambridge, 1987.Google Scholar
- Attila Földvári and Gábor Horváth, The complexity of the equation solvability and equivalence problems over finite groups International Journal of Algebra and Computation, to appear.Google Scholar
- Merrick Furst, James B. Saxe and Michael Sipser, Parity circuits and the polynomial time hierarchy, Proceedings of 22nd Annual IEEE Symposium on Foundations of Computer Science, 1981, pp. 260--270.Google ScholarDigital Library
- Mikael Goldmann and Alexander Russell, The complexity of solving equations over finite groups, Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, 1999, pp. 80--86.Google ScholarCross Ref
- Tomasz Gorazd and Jacek Krzaczkowski, Term equation satisfiability over finite algebras, International Journal of Algebra and Computation, 20(2010), 1001--1020.Google ScholarCross Ref
- Johan Torkel Håstad, Computational limitations of small-depth circuits, PhD thesis, MIT, 1987.Google Scholar
- David Hobby and Ralph McKenzie, The Structure of Finite Algebras, Contemporary Mathematics vol. 76, Amer. Math. Soc., Providence, RI, 1988.Google Scholar
- Gábor Horváth, The complexity of the equivalence and equation solvability problems over meta-Abelian groups, Journal of Algebra, 433(2015), 208--230.Google ScholarCross Ref
- Gábor Horváth and Csaba Szabó, The complexity of checking identities over finite groups, International Journal of Algebra and Computation, 16(2006), 931--940.Google ScholarCross Ref
- Paweł M. Idziak and Jacek Krzaczkowski, Satisfiability in multi-valued circuits, LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018, pp. 550--558.Google Scholar
- Paweł M. Idziak, Piotr Kawałek and Jacek Krzaczkowski, Expressive power, satisfiability and equivalence of circuits over nilpotent algebras, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.Google Scholar
- Paweł M. Idziak, Piotr Kawałek and Jacek Krzaczkowski, Stratifying algebras by supernilpotent intervals, manuscript 2020.Google Scholar
- Piotr Kawałek, Michael Kompatscher and Jacek Krzaczkowski, Circuit equivalence in 2-nilpotent algebras, preprint arXiv:1909.12256, (2019).Google Scholar
- Piotr Kawałek and Jacek Krzaczkowski, Even faster algorithms for circuit satisfiability over supenilpotent algebras, preprint arXiv:2002.08634, (2020).Google Scholar
- Keith A. Kearnes, Congruence modular varieties with small free spectra, Algebra Universalis, 42(1999), 165--181.Google ScholarCross Ref
- Michael Kompatscher, CC-circuits and the expressive power of nilpotent algebras, preprint arXiv:1911.01479, (2019).Google Scholar
- Peter Mayr and Agnes Szendrei, Algebras from Congruences, preprint arXiv:1910.00689 (2019).Google Scholar
- Ralph McKenzie, George McNulty and Walter Taylor, Algebras, Lattices, Varieties, Wadsworth/Brooks Cole, Monterrey, CA, 1987.Google Scholar
- Michael Sipser, Borel Sets and circuit complexity, Proceedings of 15th Annual ACM Symposium on Theory of Computing 1983, pp. 61--69.Google Scholar
- Joel WanderWerf, Wreath Decomposition of Algebra, PhD thesis, University of California, Berkley 1995.Google Scholar
- Armin Weiß, Hardness of equations over finite solvable groups under the exponential time hypothesis, The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020), to appear.Google Scholar
- Andrew Yao, Separating the polynomial-time hierarchy by oracles, 1985 IEEE 26th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 1985.Google ScholarDigital Library
- Dmitriy Zhuk, A proof of CSP dichotomy conjecture, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2017.Google ScholarCross Ref
Index Terms
- Intermediate problems in modular circuits satisfiability
Recommendations
Complexity of Modular Circuits
LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer ScienceWe study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to classify (...
Satisfiability in multi-valued circuits
LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer ScienceSatisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside ...
Satisfiability in MultiValued Circuits
The satisfiability of Boolean circuits is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside the Boolean realm and consider circuits built of any fixed set of gates on an arbitrarily ...
Comments