Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Krzaczkowski, Jacek"'
We 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
Externí odkaz:
http://arxiv.org/abs/2106.02947
The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for non-solva
Externí odkaz:
http://arxiv.org/abs/2010.11788
In arXiv:1710.08163 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 p
Externí odkaz:
http://arxiv.org/abs/2002.08626
Autor:
Kawałek, Piotr, Krzaczkowski, Jacek
In this paper two algorithms solving circuit satisfiability problem over supernilpotent algebras are presented. The first one is deterministic and is faster than fastest previous algorithm presented by Aichinger. The second one is probabilistic with
Externí odkaz:
http://arxiv.org/abs/2002.08634
The circuit equivalence problem of a finite algebra $\mathbf A$ is the computational problem of deciding whether two circuits over $\mathbf A$ define the same function or not. This problem not just generalises the equivalence problem for Boolean circ
Externí odkaz:
http://arxiv.org/abs/1909.12256
Autor:
Idziak, Paweł M., Krzaczkowski, Jacek
Satisfiability 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 outs
Externí odkaz:
http://arxiv.org/abs/1710.08163
Publikováno v:
Theory of Computing Systems; Aug2024, Vol. 68 Issue 4, p740-757, 18p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Krzaczkowski, Jacek, Gorazd, Tomasz
Publikováno v:
Reports on Mathematical Logic. (46):91-108
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=215308
Over twenty years ago, Goldmann and Russell initiated the study of the complexity of the equation satisfiability problem (PolSat and the NUDFA program satisfiability problem (ProgramSat) in finite groups. They showed that these problems are in 𝖯 f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6198ad0b446435fe0ca1f49cbefd5fe2