Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Idziak, Paweł"'
Autor:
Idziak, Paweł1 (AUTHOR), Kawałek, Piotr1 (AUTHOR), Krzaczkowski, Jacek2 (AUTHOR), Weiß, Armin3 (AUTHOR) armin.weiss@fmi.uni-stuttgart.de
Publikováno v:
Theory of Computing Systems. Aug2024, Vol. 68 Issue 4, p740-757. 18p.
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:
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:
Przegląd Elektrotechniczny; 2024, Issue 8, p110-114, 5p
Publikováno v:
Przegląd Elektrotechniczny; 2024, Issue 7, p174-179, 6p
We investigate quantitative properties of BCI and BCK logics. The first part of the paper compares the number of formulas provable in BCI versus BCK logics. We consider formulas built on implication and a fixed set of $k$ variables. We investigate th
Externí odkaz:
http://arxiv.org/abs/1112.0643
Publikováno v:
Przegląd Elektrotechniczny; 2023, Vol. 2023 Issue 12, p240-243, 5p
Publikováno v:
Archives of Electrical Engineering, Vol 66, Iss 3, Pp 523-531 (2017)
The paper considers the influence of core saturation on the dynamics of magnetostrictive fast-acting actuator. The field-circuit mathematical model of the dynamic operation of the capacitor-actuator system is applied. Two kinds of magnetostrictive co
Externí odkaz:
https://doaj.org/article/d67e876ef1004c86b5dd57bff4397aa1