Zhu, Mingqiang; Cheng, Xueyun; Zhu, Pengcheng; Chen, Liang; Guan, Zhijin Physical constraint-aware CNOT quantum circuit synthesis and optimization. (English) Zbl 07636878 Quantum Inf. Process. 22, No. 1, Paper No. 10, 19 p. (2023). MSC: 81P68 PDF BibTeX XML Cite \textit{M. Zhu} et al., Quantum Inf. Process. 22, No. 1, Paper No. 10, 19 p. (2023; Zbl 07636878) Full Text: DOI OpenURL
Red’kin, N. P. On the complexity of implementation of characteristic functions of the spheres by circuits of functional elements. (English. Russian original) Zbl 07596805 Mosc. Univ. Math. Bull. 77, No. 3, 127-130 (2022); translation from Vestn. Mosk. Univ., Ser. I 77, No. 3, 18-20 (2022). MSC: 94Cxx 68Qxx 68Wxx PDF BibTeX XML Cite \textit{N. P. Red'kin}, Mosc. Univ. Math. Bull. 77, No. 3, 127--130 (2022; Zbl 07596805); translation from Vestn. Mosk. Univ., Ser. I 77, No. 3, 18--20 (2022) Full Text: DOI OpenURL
Huang, Xuangui; Viola, Emanuele Approximate degree, weight, and indistinguishability. (English) Zbl 1495.68063 ACM Trans. Comput. Theory 14, No. 1, Paper No. 3, 26 p. (2022). MSC: 68Q06 41A10 60C05 68Q87 94D10 PDF BibTeX XML Cite \textit{X. Huang} and \textit{E. Viola}, ACM Trans. Comput. Theory 14, No. 1, Paper No. 3, 26 p. (2022; Zbl 1495.68063) Full Text: DOI OpenURL
Mundici, Daniele The read once formula of a series-parallel network. (English) Zbl 07574724 Discrete Appl. Math. 320, 304-310 (2022). MSC: 06Exx 91Axx 06-XX PDF BibTeX XML Cite \textit{D. Mundici}, Discrete Appl. Math. 320, 304--310 (2022; Zbl 07574724) Full Text: DOI OpenURL
Sun, Xiaoming; Sun, Yuan; Wu, Kewen; Xia, Zhiyu On the relationship between energy complexity and other Boolean function measures. (English) Zbl 1495.90163 J. Comb. Optim. 43, No. 5, 1470-1492 (2022). MSC: 90C27 90C90 PDF BibTeX XML Cite \textit{X. Sun} et al., J. Comb. Optim. 43, No. 5, 1470--1492 (2022; Zbl 1495.90163) Full Text: DOI arXiv OpenURL
Popkov, K. A. Short complete diagnostic tests for circuits with one additional input in the standard basis. (Russian. English summary) Zbl 1497.94201 Prikl. Diskretn. Mat. 2022, No. 56, 104-112 (2022). MSC: 94C11 94C12 94D10 68Q25 PDF BibTeX XML Cite \textit{K. A. Popkov}, Prikl. Diskretn. Mat. 2022, No. 56, 104--112 (2022; Zbl 1497.94201) Full Text: DOI MNR OpenURL
Chattopadhyay, Arkadev; Mande, Nikhil S. A short list of equalities induces large sign-rank. (English) Zbl 07554610 SIAM J. Comput. 51, No. 3, 820-848 (2022). MSC: 68Q11 68Q06 68Q15 68Q17 PDF BibTeX XML Cite \textit{A. Chattopadhyay} and \textit{N. S. Mande}, SIAM J. Comput. 51, No. 3, 820--848 (2022; Zbl 07554610) Full Text: DOI OpenURL
Jukna, Stasys; Lingas, Andrzej Lower bounds for Boolean circuits of bounded negation width. (English) Zbl 1492.68048 J. Comput. Syst. Sci. 129, 90-105 (2022). MSC: 68Q06 94C11 PDF BibTeX XML Cite \textit{S. Jukna} and \textit{A. Lingas}, J. Comput. Syst. Sci. 129, 90--105 (2022; Zbl 1492.68048) Full Text: DOI OpenURL
Dressler, Mareike; Kurpisz, Adam; de Wolff, Timo Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials. (English) Zbl 07533992 Found. Comput. Math. 22, No. 2, 365-387 (2022). MSC: 14P10 68Q25 90C09 PDF BibTeX XML Cite \textit{M. Dressler} et al., Found. Comput. Math. 22, No. 2, 365--387 (2022; Zbl 07533992) Full Text: DOI OpenURL
Lyubich, Iľya G.; Romanov, Dmitriy S. Single diagnostic tests for inversion faults of gates in circuits over arbitrary bases. (English. Russian original) Zbl 1492.94228 Discrete Math. Appl. 32, No. 1, 1-9 (2022); translation from Diskretn. Mat. 33, No. 1, 20-30 (2021). MSC: 94C12 94C11 PDF BibTeX XML Cite \textit{I. G. Lyubich} and \textit{D. S. Romanov}, Discrete Math. Appl. 32, No. 1, 1--9 (2022; Zbl 1492.94228); translation from Diskretn. Mat. 33, No. 1, 20--30 (2021) Full Text: DOI OpenURL
Popkov, K. A. On self-correcting logic circuits of unreliable gates with at most two inputs. (English. Russian original) Zbl 1490.94085 Math. Notes 111, No. 1, 157-160 (2022); translation from Mat. Zametki 111, No. 1, 145-148 (2022). MSC: 94C11 94D10 PDF BibTeX XML Cite \textit{K. A. Popkov}, Math. Notes 111, No. 1, 157--160 (2022; Zbl 1490.94085); translation from Mat. Zametki 111, No. 1, 145--148 (2022) Full Text: DOI OpenURL
Steinbach, Bernd; Posthoff, Christian Logic functions and equations. Fundamentals and applications using the XBOOLE-monitor. 3rd expanded and updated edition. (English) Zbl 1487.94002 Cham: Springer (ISBN 978-3-030-88944-9/hbk; 978-3-030-88945-6/ebook). xvi, 810 p. (2022). MSC: 94-01 94D10 PDF BibTeX XML Cite \textit{B. Steinbach} and \textit{C. Posthoff}, Logic functions and equations. Fundamentals and applications using the XBOOLE-monitor. 3rd expanded and updated edition. Cham: Springer (2022; Zbl 1487.94002) Full Text: DOI OpenURL
Aleksandrova, N. E.; Romanov, D. S. Lower bound of the length of a single fault diagnostic test with respect to insertions of a mod-2 adder. (English. Russian original) Zbl 07617499 Comput. Math. Model. 32, No. 4, 500-504 (2021); translation from Prikl. Mat. Inf. 68, 88-96 (2021). MSC: 94C12 94C11 PDF BibTeX XML Cite \textit{N. E. Aleksandrova} and \textit{D. S. Romanov}, Comput. Math. Model. 32, No. 4, 500--504 (2021; Zbl 07617499); translation from Prikl. Mat. Inf. 68, 88--96 (2021) Full Text: DOI OpenURL
Gurov, S. I.; Zolotarev, D. V.; Samburskii, A. I. Artificial neural networks and logic circuit synthesis. (English. Russian original) Zbl 1499.68328 Comput. Math. Model. 32, No. 4, 490-499 (2021); translation from Prikl. Mat. Inf. 68, 75-87 (2021). MSC: 68T07 90C40 94C11 PDF BibTeX XML Cite \textit{S. I. Gurov} et al., Comput. Math. Model. 32, No. 4, 490--499 (2021; Zbl 1499.68328); translation from Prikl. Mat. Inf. 68, 75--87 (2021) Full Text: DOI OpenURL
Temerbekova, G.; Romanov, D. S. The length of single-fault detection tests with respect to substitution of inverters for combinational elements in some bases. (English. Russian original) Zbl 1492.94230 Comput. Math. Model. 32, No. 3, 356-363 (2021); translation from Prikl. Mat. Inf. 67, 89-100 (2021). MSC: 94C12 94C11 94D10 PDF BibTeX XML Cite \textit{G. Temerbekova} and \textit{D. S. Romanov}, Comput. Math. Model. 32, No. 3, 356--363 (2021; Zbl 1492.94230); translation from Prikl. Mat. Inf. 67, 89--100 (2021) Full Text: DOI OpenURL
Kombarov, Yu. A. Lower bound of circuit complexity of parity function in a basis of unbounded fan-in. (English. Russian original) Zbl 1497.94199 Mosc. Univ. Math. Bull. 76, No. 6, 266-270 (2021); translation from Vestn. Mosk. Univ., Ser. I 76, No. 6, 48-51 (2021). MSC: 94C11 94D10 PDF BibTeX XML Cite \textit{Yu. A. Kombarov}, Mosc. Univ. Math. Bull. 76, No. 6, 266--270 (2021; Zbl 1497.94199); translation from Vestn. Mosk. Univ., Ser. I 76, No. 6, 48--51 (2021) Full Text: DOI OpenURL
Matrosova, A. Yu.; Chernyshov, S. V.; Kim, O. Kh.; Nikolaeva, E. A. Constructing a sequence detecting robustly testable path delay faults in sequential circuits. (English. Russian original) Zbl 1497.94207 Autom. Remote Control 82, No. 11, 1949-1965 (2021); translation from Avtom. Telemekh. 2021, No. 11, 148-168 (2021). MSC: 94C12 94C11 PDF BibTeX XML Cite \textit{A. Yu. Matrosova} et al., Autom. Remote Control 82, No. 11, 1949--1965 (2021; Zbl 1497.94207); translation from Avtom. Telemekh. 2021, No. 11, 148--168 (2021) Full Text: DOI OpenURL
Reďkin, Nikolay P. Minimal contact circuits for characteristic functions of spheres. (English. Russian original) Zbl 1484.94039 Discrete Math. Appl. 31, No. 6, 403-408 (2021); translation from Diskretn. Mat. 32, No. 3, 68-75 (2020). MSC: 94C11 94D10 PDF BibTeX XML Cite \textit{N. P. Reďkin}, Discrete Math. Appl. 31, No. 6, 403--408 (2021; Zbl 1484.94039); translation from Diskretn. Mat. 32, No. 3, 68--75 (2020) Full Text: DOI OpenURL
Efanov, D. V.; Sapozhnikov, V. V.; Sapozhnikov, Vl. V. Boolean-complement based fault-tolerant electronic device architectures. (English. Russian original) Zbl 1484.94037 Autom. Remote Control 82, No. 8, 1403-1417 (2021); translation from Avtom. Telemekh. 2021, No. 8, 140-158 (2021). MSC: 94C11 PDF BibTeX XML Cite \textit{D. V. Efanov} et al., Autom. Remote Control 82, No. 8, 1403--1417 (2021; Zbl 1484.94037); translation from Avtom. Telemekh. 2021, No. 8, 140--158 (2021) Full Text: DOI OpenURL
Popkov, K. A. On self-correcting logic circuits of unreliable gates. (English) Zbl 1490.94083 Lobachevskii J. Math. 42, No. 11, 2637-2644 (2021). MSC: 94C11 94D10 PDF BibTeX XML Cite \textit{K. A. Popkov}, Lobachevskii J. Math. 42, No. 11, 2637--2644 (2021; Zbl 1490.94083) Full Text: DOI OpenURL
Mahzoon, Alireza; Große, Daniel; Drechsler, Rolf Genmul: generating architecturally complex multipliers to challenge formal verification tools. (English) Zbl 07410746 Drechsler, Rolf (ed.) et al., Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24–25, 2020. Cham: Springer. 177-191 (2021). MSC: 68Q60 68Q06 94C11 PDF BibTeX XML Cite \textit{A. Mahzoon} et al., in: Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24--25, 2020. Cham: Springer. 177--191 (2021; Zbl 07410746) Full Text: DOI OpenURL
Moraga, Claudio Hybrid control of Toffoli and Peres gates. (English) Zbl 07410745 Drechsler, Rolf (ed.) et al., Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24–25, 2020. Cham: Springer. 167-175 (2021). MSC: 68Q06 94C11 PDF BibTeX XML Cite \textit{C. Moraga}, in: Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24--25, 2020. Cham: Springer. 167--175 (2021; Zbl 07410745) Full Text: DOI OpenURL
Miller, D. Michael; Dueck, Gerhard W. Translation techniques for reversible circuit synthesis with positive and negative controls. (English) Zbl 07410744 Drechsler, Rolf (ed.) et al., Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24–25, 2020. Cham: Springer. 143-165 (2021). MSC: 68Q06 94C11 PDF BibTeX XML Cite \textit{D. M. Miller} and \textit{G. W. Dueck}, in: Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24--25, 2020. Cham: Springer. 143--165 (2021; Zbl 07410744) Full Text: DOI OpenURL
van Santen, Victor M.; Klemme, Florian; Amrouch, Hussam The vital role of machine learning in developing emerging technologies. (English) Zbl 07410739 Drechsler, Rolf (ed.) et al., Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24–25, 2020. Cham: Springer. 29-57 (2021). MSC: 68T05 68Q06 94C11 PDF BibTeX XML Cite \textit{V. M. van Santen} et al., in: Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24--25, 2020. Cham: Springer. 29--57 (2021; Zbl 07410739) Full Text: DOI OpenURL
Srinivasan, Srikanth; Tripathi, Utkarsh; Venkitesh, S. On the probabilistic degrees of symmetric Boolean functions. (English) Zbl 07396320 SIAM J. Discrete Math. 35, No. 3, 2070-2092 (2021). MSC: 68Q06 68Q10 68Q17 PDF BibTeX XML Cite \textit{S. Srinivasan} et al., SIAM J. Discrete Math. 35, No. 3, 2070--2092 (2021; Zbl 07396320) Full Text: DOI arXiv OpenURL
Redkin, Nikolay P. Implementation complexity of Boolean functions with a small number of ones. (English. Russian original) Zbl 1482.94093 Discrete Math. Appl. 31, No. 4, 271-279 (2021); translation from Diskretn. Mat. 32, No. 2, 32-43 (2020). MSC: 94D10 94C05 PDF BibTeX XML Cite \textit{N. P. Redkin}, Discrete Math. Appl. 31, No. 4, 271--279 (2021; Zbl 1482.94093); translation from Diskretn. Mat. 32, No. 2, 32--43 (2020) Full Text: DOI OpenURL
Popkov, Kirill A. Bounds on Shannon functions of lengths of contact closure tests for contact circuits. (English. Russian original) Zbl 1483.94079 Discrete Math. Appl. 31, No. 3, 165-178 (2021); translation from Diskretn. Mat. 32, No. 3, 49-67 (2020). MSC: 94C11 94C12 94D10 PDF BibTeX XML Cite \textit{K. A. Popkov}, Discrete Math. Appl. 31, No. 3, 165--178 (2021; Zbl 1483.94079); translation from Diskretn. Mat. 32, No. 3, 49--67 (2020) Full Text: DOI OpenURL
Red’kin, N. P. Minimal contact circuits for a sequence of Boolean functions. (English. Russian original) Zbl 1497.94202 Math. Notes 110, No. 1, 156-158 (2021); translation from Mat. Zametki 110, No. 1, 155-157 (2021). Reviewer: Nikolay Kyurkchiev (Plovdiv) MSC: 94C11 68Q06 PDF BibTeX XML Cite \textit{N. P. Red'kin}, Math. Notes 110, No. 1, 156--158 (2021; Zbl 1497.94202); translation from Mat. Zametki 110, No. 1, 155--157 (2021) Full Text: DOI OpenURL
Sergeev, I. S. Formula complexity of a linear function in a \(k\)-ary basis. (English. Russian original) Zbl 1484.94046 Math. Notes 109, No. 3, 445-458 (2021); translation from Mat. Zametki 109, No. 3, 419-435 (2021). MSC: 94D10 68Q06 PDF BibTeX XML Cite \textit{I. S. Sergeev}, Math. Notes 109, No. 3, 445--458 (2021; Zbl 1484.94046); translation from Mat. Zametki 109, No. 3, 419--435 (2021) Full Text: DOI OpenURL
Red’kin, N. P. Asymptotics for the complexity of Boolean functions with small number of ones. (English. Russian original) Zbl 1495.94173 Math. Notes 109, No. 2, 256-261 (2021); translation from Mat. Zametki 109, No. 2, 257-263 (2021). MSC: 94D10 94C11 PDF BibTeX XML Cite \textit{N. P. Red'kin}, Math. Notes 109, No. 2, 256--261 (2021; Zbl 1495.94173); translation from Mat. Zametki 109, No. 2, 257--263 (2021) Full Text: DOI OpenURL
Du, Haijun; Zhang, Jianguo; Liu, Haifang; Gong, Lishuang; Liu, Feng; Wang, Yuncai Autonomous Boolean network and physical random number generator based on XOR gate. (Chinese. English summary) Zbl 1474.94064 J. Shenzhen Univ., Sci. Eng. 38, No. 1, 103-109 (2021). MSC: 94A60 94C11 94D10 PDF BibTeX XML Cite \textit{H. Du} et al., J. Shenzhen Univ., Sci. Eng. 38, No. 1, 103--109 (2021; Zbl 1474.94064) Full Text: DOI OpenURL
Jukna, Stasys Notes on hazard-free circuits. (English) Zbl 1476.68084 SIAM J. Discrete Math. 35, No. 2, 770-787 (2021). MSC: 68Q06 68Q17 94C11 PDF BibTeX XML Cite \textit{S. Jukna}, SIAM J. Discrete Math. 35, No. 2, 770--787 (2021; Zbl 1476.68084) Full Text: DOI arXiv OpenURL
Drechsler, Rolf (ed.); Große, Daniel (ed.) Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24–25, 2020. (English) Zbl 1470.94002 Cham: Springer (ISBN 978-3-030-68070-1/hbk; 978-3-030-68073-2/pbk; 978-3-030-68071-8/ebook). vii, 197 p. (2021). MSC: 94-06 68-06 68Q06 94C11 00B25 PDF BibTeX XML Cite \textit{R. Drechsler} (ed.) and \textit{D. Große} (ed.), Recent findings in Boolean techniques. Selected papers from the 14th international workshop on Boolean problems, IWSBP, virtual, September 24--25, 2020. Cham: Springer (2021; Zbl 1470.94002) Full Text: DOI OpenURL
Alekhina, M.; Barsukova, O. Asymptotically optimum on unreliability circuits in the basis consisting of the Webb function in \(P_k\) under failures of \(k-1\) type at the outputs of elements. (English) Zbl 1465.94147 Lobachevskii J. Math. 42, No. 1, 50-56 (2021). MSC: 94C05 94C11 PDF BibTeX XML Cite \textit{M. Alekhina} and \textit{O. Barsukova}, Lobachevskii J. Math. 42, No. 1, 50--56 (2021; Zbl 1465.94147) Full Text: DOI OpenURL
Li, Yaqiao Conflict complexity is lower bounded by block sensitivity. (English) Zbl 1477.68107 Theor. Comput. Sci. 856, 169-172 (2021). MSC: 68Q06 06E30 PDF BibTeX XML Cite \textit{Y. Li}, Theor. Comput. Sci. 856, 169--172 (2021; Zbl 1477.68107) Full Text: DOI arXiv OpenURL
Baghery, Karim; González, Alonso; Pindado, Zaira; Ràfols, Carla Signatures of knowledge for Boolean circuits under standard assumptions. (English) Zbl 1501.94065 Nitaj, Abderrahmane (ed.) et al., Progress in cryptology – AFRICACRYPT 2020. 12th international conference on cryptology in Africa, Cairo, Egypt, July 20–22, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12174, 24-44 (2020). MSC: 94A62 68Q06 94C11 PDF BibTeX XML Cite \textit{K. Baghery} et al., Lect. Notes Comput. Sci. 12174, 24--44 (2020; Zbl 1501.94065) Full Text: DOI OpenURL
Ilango, Rahul; Loff, Bruno; Oliveira, Igor C. NP-hardness of circuit minimization for multi-output functions. (English) Zbl 07561750 Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 22, 36 p. (2020). MSC: 68Q25 PDF BibTeX XML Cite \textit{R. Ilango} et al., LIPIcs -- Leibniz Int. Proc. Inform. 169, Article 22, 36 p. (2020; Zbl 07561750) Full Text: DOI OpenURL
Cascudo, Ignacio; Gundersen, Jaron Skovsted A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity. (English) Zbl 1485.94133 Pass, Rafael (ed.) et al., Theory of cryptography. 18th international conference, TCC 2020, Durham, NC, USA, November 16–19, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12551, 652-682 (2020). MSC: 94A62 94A60 68P25 94C05 94D10 PDF BibTeX XML Cite \textit{I. Cascudo} and \textit{J. S. Gundersen}, Lect. Notes Comput. Sci. 12551, 652--682 (2020; Zbl 1485.94133) Full Text: DOI OpenURL
Popkov, K. A. On implementation of Boolean functions by contact circuits with a constant uniform width. (English. Russian original) Zbl 1490.94084 Dokl. Math. 102, No. 3, 502-504 (2020); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 495, 65-68 (2020). MSC: 94C11 94D10 PDF BibTeX XML Cite \textit{K. A. Popkov}, Dokl. Math. 102, No. 3, 502--504 (2020; Zbl 1490.94084); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 495, 65--68 (2020) Full Text: DOI OpenURL
Sergeev, I. S. Multilevel representation and complexity of circuits of unbounded fan-in gates. (English. Russian original) Zbl 1495.94166 Mosc. Univ. Math. Bull. 75, No. 3, 121-125 (2020); translation from Vestn. Mosk. Univ., Ser. I 75, No. 3, (2020). Reviewer: Olaf Ninnemann (Uffing am Staffelsee) MSC: 94C11 68Q06 94D10 PDF BibTeX XML Cite \textit{I. S. Sergeev}, Mosc. Univ. Math. Bull. 75, No. 3, 121--125 (2020; Zbl 1495.94166); translation from Vestn. Mosk. Univ., Ser. I 75, No. 3, (2020) Full Text: DOI OpenURL
Antyufeev, G. V.; Romanov, D. S. Tests with stuck-at and shift faults on circuit inputs. (English. Russian original) Zbl 1460.94095 Comput. Math. Model. 31, No. 4, 494-500 (2020); translation from Prikl. Mat. Inf. 64, 79-85 (2020). MSC: 94C12 94C11 94D10 PDF BibTeX XML Cite \textit{G. V. Antyufeev} and \textit{D. S. Romanov}, Comput. Math. Model. 31, No. 4, 494--500 (2020; Zbl 1460.94095); translation from Prikl. Mat. Inf. 64, 79--85 (2020) Full Text: DOI OpenURL
Alekhina, M. A. About the reliability of logic circuits in all complete bases with three-input elements and failures of zero type on their outputs. (Russian. English summary) Zbl 1469.94236 Prikl. Diskretn. Mat. 2020, No. 49, 98-107 (2020). MSC: 94C11 94C60 68Q06 PDF BibTeX XML Cite \textit{M. A. Alekhina}, Prikl. Diskretn. Mat. 2020, No. 49, 98--107 (2020; Zbl 1469.94236) Full Text: DOI MNR OpenURL
Rybalov, A. N. On generic NP-completeness of the problem of Boolean circuits satisfiability. (Russian. English summary) Zbl 1455.68071 Prikl. Diskretn. Mat. 2020, No. 47, 101-107 (2020). MSC: 68Q17 68Q06 68Q25 68W01 94C11 PDF BibTeX XML Cite \textit{A. N. Rybalov}, Prikl. Diskretn. Mat. 2020, No. 47, 101--107 (2020; Zbl 1455.68071) Full Text: DOI MNR OpenURL
Alekhina, M. A.; Shornikova, T. A. About the reliability of circuits under failures of type 0 at the outputs of elements in a complete finite basis containing some pairs of functions. (English. Russian original) Zbl 1466.94069 Russ. Math. 64, No. 7, 7-12 (2020); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2020, No. 7, 10-17 (2020). MSC: 94C12 94C11 PDF BibTeX XML Cite \textit{M. A. Alekhina} and \textit{T. A. Shornikova}, Russ. Math. 64, No. 7, 7--12 (2020; Zbl 1466.94069); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2020, No. 7, 10--17 (2020) Full Text: DOI OpenURL
Beneš, Nikola; Brim, Luboš; Kadlecaj, Jakub; Pastva, Samuel; Šafránek, David AEON: attractor bifurcation analysis of parametrised Boolean networks. (English) Zbl 1478.68085 Lahiri, Shuvendu Kumar (ed.) et al., Computer aided verification. 32nd international conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12224, 569-581 (2020). MSC: 68Q06 37B35 37G35 PDF BibTeX XML Cite \textit{N. Beneš} et al., Lect. Notes Comput. Sci. 12224, 569--581 (2020; Zbl 1478.68085) Full Text: DOI OpenURL
Beyersdorff, Olaf; Blinkhorn, Joshua; Mahajan, Meena Hardness characterisations and size-width lower bounds for QBF resolution. (English) Zbl 1498.03149 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 209-223 (2020). MSC: 03F20 68Q17 PDF BibTeX XML Cite \textit{O. Beyersdorff} et al., in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 209--223 (2020; Zbl 1498.03149) Full Text: DOI OpenURL
Red’kin, N. P. Minimal contact circuits for symmetric threshold functions. (English. Russian original) Zbl 1477.94086 Math. Notes 108, No. 3, 370-380 (2020); translation from Mat. Zametki 108, No. 3, 397-411 (2020). MSC: 94C11 PDF BibTeX XML Cite \textit{N. P. Red'kin}, Math. Notes 108, No. 3, 370--380 (2020; Zbl 1477.94086); translation from Mat. Zametki 108, No. 3, 397--411 (2020) Full Text: DOI OpenURL
Dinesh, Krishnamoorthy; Otiv, Samir; Sarma, Jayalal New bounds for energy complexity of Boolean functions. (English) Zbl 1467.68053 Theor. Comput. Sci. 845, 59-75 (2020). MSC: 68Q06 94C11 PDF BibTeX XML Cite \textit{K. Dinesh} et al., Theor. Comput. Sci. 845, 59--75 (2020; Zbl 1467.68053) Full Text: DOI arXiv OpenURL
Jaiswal, Ragesh A note on the relation between XOR and selective XOR lemmas. (English) Zbl 1462.68080 Inf. Process. Lett. 163, Article ID 106011, 2 p. (2020). MSC: 68Q25 68Q06 68Q17 94D10 PDF BibTeX XML Cite \textit{R. Jaiswal}, Inf. Process. Lett. 163, Article ID 106011, 2 p. (2020; Zbl 1462.68080) Full Text: DOI arXiv OpenURL
Lialina, A. A. On the complexity of unique circuit SAT. (English. Russian original) Zbl 1442.68053 J. Math. Sci., New York 247, No. 3, 457-466 (2020); translation from Zap. Nauchn. Semin. POMI 475, 122-136 (2018). MSC: 68Q06 68R07 68W40 94C11 PDF BibTeX XML Cite \textit{A. A. Lialina}, J. Math. Sci., New York 247, No. 3, 457--466 (2020; Zbl 1442.68053); translation from Zap. Nauchn. Semin. POMI 475, 122--136 (2018) Full Text: DOI OpenURL
Karthikeyan, Rohan; Sinha, Siddharth; Patil, Vallabh On the resolution of the sensitivity conjecture. (English) Zbl 1454.68107 Bull. Am. Math. Soc., New Ser. 57, No. 4, 615-638 (2020). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C35 15A24 68Q06 68Q17 94C11 94D10 PDF BibTeX XML Cite \textit{R. Karthikeyan} et al., Bull. Am. Math. Soc., New Ser. 57, No. 4, 615--638 (2020; Zbl 1454.68107) Full Text: DOI arXiv OpenURL
Bun, Mark; Thaler, Justin A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\). (English) Zbl 1471.68092 SIAM J. Comput. 49, No. 4, FOCS17-59-FOCS17-96 (2020). Reviewer: Peter Kostolányi (Bratislava) MSC: 68Q06 68Q11 68Q15 68Q17 94A62 PDF BibTeX XML Cite \textit{M. Bun} and \textit{J. Thaler}, SIAM J. Comput. 49, No. 4, FOCS17--59-FOCS17--96 (2020; Zbl 1471.68092) Full Text: DOI arXiv OpenURL
Curzi, Gianluca; Roversi, Luca A type-assignment of linear erasure and duplication. (English) Zbl 1484.03128 Theor. Comput. Sci. 837, 26-53 (2020). MSC: 03F52 03B40 68Q06 PDF BibTeX XML Cite \textit{G. Curzi} and \textit{L. Roversi}, Theor. Comput. Sci. 837, 26--53 (2020; Zbl 1484.03128) Full Text: DOI arXiv OpenURL
Popkov, Kirill A. On diagnostic tests of contact break for contact circuits. (English. Russian original) Zbl 1465.94149 Discrete Math. Appl. 30, No. 2, 103-116 (2020); translation from Diskretn. Mat. 31, No. 2, 123-142 (2019). MSC: 94C11 94D10 PDF BibTeX XML Cite \textit{K. A. Popkov}, Discrete Math. Appl. 30, No. 2, 103--116 (2020; Zbl 1465.94149); translation from Diskretn. Mat. 31, No. 2, 123--142 (2019) Full Text: DOI OpenURL
Amarilli, Antoine; Capelli, Florent; Monet, Mikaël; Senellart, Pierre Connecting knowledge compilation classes and width parameters. (Connecting knowledge compilation classes width parameters.) (English) Zbl 1446.68149 Theory Comput. Syst. 64, No. 5, 861-914 (2020). MSC: 68T30 68P05 68P15 PDF BibTeX XML Cite \textit{A. Amarilli} et al., Theory Comput. Syst. 64, No. 5, 861--914 (2020; Zbl 1446.68149) Full Text: DOI arXiv OpenURL
Popkov, K. A. Short tests of closures for contact circuits. (English. Russian original) Zbl 1448.94304 Math. Notes 107, No. 4, 653-662 (2020); translation from Mat. Zametki 107, No. 4, 591-603 (2020). MSC: 94C11 94D10 PDF BibTeX XML Cite \textit{K. A. Popkov}, Math. Notes 107, No. 4, 653--662 (2020; Zbl 1448.94304); translation from Mat. Zametki 107, No. 4, 591--603 (2020) Full Text: DOI OpenURL
Lingas, Andrzej Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth. (English) Zbl 1433.68141 Theor. Comput. Sci. 820, 17-25 (2020). MSC: 68Q06 PDF BibTeX XML Cite \textit{A. Lingas}, Theor. Comput. Sci. 820, 17--25 (2020; Zbl 1433.68141) Full Text: DOI OpenURL
Engels, Christian; Garg, Mohit; Makino, Kazuhisa; Rao, Anup On expressing majority as a majority of majorities. (English) Zbl 1460.94091 SIAM J. Discrete Math. 34, No. 1, 730-741 (2020). MSC: 94C05 PDF BibTeX XML Cite \textit{C. Engels} et al., SIAM J. Discrete Math. 34, No. 1, 730--741 (2020; Zbl 1460.94091) Full Text: DOI OpenURL
Chillotti, Ilaria; Gama, Nicolas; Georgieva, Mariya; Izabachène, Malika TFHE: fast fully homomorphic encryption over the torus. (English) Zbl 1455.94141 J. Cryptology 33, No. 1, 34-91 (2020). MSC: 94A60 PDF BibTeX XML Cite \textit{I. Chillotti} et al., J. Cryptology 33, No. 1, 34--91 (2020; Zbl 1455.94141) Full Text: DOI Link OpenURL
Viola, Emanuele Sampling lower bounds: Boolean average-case and permutations. (English) Zbl 1435.68092 SIAM J. Comput. 49, No. 1, 119-137 (2020). MSC: 68Q06 68P05 68Q17 PDF BibTeX XML Cite \textit{E. Viola}, SIAM J. Comput. 49, No. 1, 119--137 (2020; Zbl 1435.68092) Full Text: DOI OpenURL
Redkin, Nikolay P. The generalized complexity of linear Boolean functions. (English. Russian original) Zbl 1447.94072 Discrete Math. Appl. 30, No. 1, 39-44 (2020); translation from Diskretn. Mat. 30, No. 4, 88-95 (2018). MSC: 94C11 94D10 06E30 PDF BibTeX XML Cite \textit{N. P. Redkin}, Discrete Math. Appl. 30, No. 1, 39--44 (2020; Zbl 1447.94072); translation from Diskretn. Mat. 30, No. 4, 88--95 (2018) Full Text: DOI OpenURL
Ciencialová, Lucie; Cienciala, Luděk Two notes on APCol systems. (English) Zbl 1436.68112 Theor. Comput. Sci. 805, 161-174 (2020). MSC: 68Q07 68Q06 94C11 PDF BibTeX XML Cite \textit{L. Ciencialová} and \textit{L. Cienciala}, Theor. Comput. Sci. 805, 161--174 (2020; Zbl 1436.68112) Full Text: DOI OpenURL
Golovnev, Alexander; Ilango, Rahul; Impagliazzo, Russell; Kabanets, Valentine; Kolokolova, Antonina; Tal, Avishay AC\(^0[p]\) lower bounds against MCSP via the coin problem. (English) Zbl 07561559 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 66, 15 p. (2019). MSC: 68Nxx 68Qxx PDF BibTeX XML Cite \textit{A. Golovnev} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 66, 15 p. (2019; Zbl 07561559) Full Text: DOI OpenURL
Alekhina, M. A.; Grabovskaya, S. M.; Gusynina, Yu. S. Sufficient conditions for implementation of Boolean functions by asymptotically optimal on reliability circuits with the trivial estimate of unreliability in the case of faults of type 0 at the element outputs. (Russian. English summary) Zbl 1466.94068 Prikl. Diskretn. Mat. 2019, No. 45, 44-54 (2019). MSC: 94C12 94C11 PDF BibTeX XML Cite \textit{M. A. Alekhina} et al., Prikl. Diskretn. Mat. 2019, No. 45, 44--54 (2019; Zbl 1466.94068) Full Text: DOI MNR OpenURL
Zhao, Jiwei; Shi, Xiaolong Research on high-sensitive precise logic gates based on DNA strand replacement. (Chinese. English summary) Zbl 1456.68050 J. Guangzhou Univ., Nat. Sci. 18, No. 6, 35-44 (2019). MSC: 68Q07 68Q06 92C40 94C11 PDF BibTeX XML Cite \textit{J. Zhao} and \textit{X. Shi}, J. Guangzhou Univ., Nat. Sci. 18, No. 6, 35--44 (2019; Zbl 1456.68050) OpenURL
Alekhina, M.; Barsukova, O.; Shornikova, T. About the reliability of circuits in the complete finite basis containing an essential linear function. (English) Zbl 1469.94239 Lobachevskii J. Math. 40, No. 12, 2027-2033 (2019). MSC: 94C11 94C60 68Q06 PDF BibTeX XML Cite \textit{M. Alekhina} et al., Lobachevskii J. Math. 40, No. 12, 2027--2033 (2019; Zbl 1469.94239) Full Text: DOI OpenURL
Nazari, Soheila; Faez, Karim Novel systematic mathematical computation based on the spiking frequency gate (SFG): innovative organization of spiking computer. (English) Zbl 1441.68045 Inf. Sci. 474, 221-235 (2019). MSC: 68Q06 68Q07 68T10 92B20 92C20 PDF BibTeX XML Cite \textit{S. Nazari} and \textit{K. Faez}, Inf. Sci. 474, 221--235 (2019; Zbl 1441.68045) Full Text: DOI OpenURL
Lozhkin, S. A.; Dovgalyuk, E. L. Depth of schemes embedded in a unit cube and implementing typical Boolean functions. (English. Russian original) Zbl 1466.94066 Mosc. Univ. Comput. Math. Cybern. 43, No. 4, 177-180 (2019); translation from Vestn. Mosk. Univ., Ser. XV 2019, No. 4, 33-36 (2019). MSC: 94C11 68Q06 PDF BibTeX XML Cite \textit{S. A. Lozhkin} and \textit{E. L. Dovgalyuk}, Mosc. Univ. Comput. Math. Cybern. 43, No. 4, 177--180 (2019; Zbl 1466.94066); translation from Vestn. Mosk. Univ., Ser. XV 2019, No. 4, 33--36 (2019) Full Text: DOI OpenURL
Sun, Xiaoming; Sun, Yuan; Wu, Kewen; Xia, Zhiyu On the relationship between energy complexity and other Boolean function measures. (English) Zbl 07172866 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11653, 516-528 (2019). MSC: 68Rxx PDF BibTeX XML Cite \textit{X. Sun} et al., Lect. Notes Comput. Sci. 11653, 516--528 (2019; Zbl 07172866) Full Text: DOI arXiv OpenURL
Zhao, Ying; Zhao, Jun Event-triggered bumpless transfer control for switched systems with its application to switched RLC circuits. (English) Zbl 1430.94115 Nonlinear Dyn. 98, No. 3, 1615-1628 (2019). MSC: 94C11 94C05 PDF BibTeX XML Cite \textit{Y. Zhao} and \textit{J. Zhao}, Nonlinear Dyn. 98, No. 3, 1615--1628 (2019; Zbl 1430.94115) Full Text: DOI OpenURL
Ikenmeyer, Christian; Komarath, Balagopal; Lenzen, Christoph; Lysikov, Vladimir; Mokhov, Andrey; Sreenivasaiah, Karteek On the complexity of hazard-free circuits. (English) Zbl 1473.94170 J. ACM 66, No. 4, Article No. 25, 20 p. (2019). MSC: 94C11 68Q06 68Q17 94C12 PDF BibTeX XML Cite \textit{C. Ikenmeyer} et al., J. ACM 66, No. 4, Article No. 25, 20 p. (2019; Zbl 1473.94170) Full Text: DOI arXiv OpenURL
Alekhina, Marina A.; Barsukova, O. Yu. Synthesis of reliable circuits in the basis consisting of the Webb function in \(P_k\). (English. Russian original) Zbl 1469.94238 Russ. Math. 63, No. 7, 12-23 (2019); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2019, No. 7, 15-28 (2019). MSC: 94C11 94C05 94D10 PDF BibTeX XML Cite \textit{M. A. Alekhina} and \textit{O. Yu. Barsukova}, Russ. Math. 63, No. 7, 12--23 (2019; Zbl 1469.94238); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2019, No. 7, 15--28 (2019) Full Text: DOI OpenURL
Blass, Andreas; Gurevich, Yuri Circuit pedantry. (English) Zbl 1428.68149 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 129, 20 p. (2019). MSC: 68Q06 81P68 94C11 PDF BibTeX XML Cite \textit{A. Blass} and \textit{Y. Gurevich}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 129, 20 p. (2019; Zbl 1428.68149) Full Text: arXiv Link OpenURL
Alekhina, M. A.; Gusynina, Yu. S.; Shornikova, T. A. About reliability of circuits with faults of type 0 at the outputs of elements in a full finite basis containing a special function. (English. Russian original) Zbl 1430.94117 Russ. Math. 63, No. 6, 79-81 (2019); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2019, No. 6, 85-88 (2019). MSC: 94C12 68M15 94C05 94D10 PDF BibTeX XML Cite \textit{M. A. Alekhina} et al., Russ. Math. 63, No. 6, 79--81 (2019; Zbl 1430.94117); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2019, No. 6, 85--88 (2019) Full Text: DOI OpenURL
Kreowski, Hans-Jörg; Lye, Aaron Canonical mixed-polarity multi-target Toffoli circuits: shift and removal. (English) Zbl 1435.68091 Inf. Comput. 269, Article ID 104450, 19 p. (2019). MSC: 68Q06 68Q09 81P68 94C11 PDF BibTeX XML Cite \textit{H.-J. Kreowski} and \textit{A. Lye}, Inf. Comput. 269, Article ID 104450, 19 p. (2019; Zbl 1435.68091) Full Text: DOI OpenURL
Canonne, Clément L.; Grigorescu, Elena; Guo, Siyao; Kumar, Akash; Wimmer, Karl Testing \(k\)-monotonicity. The rise and fall of Boolean functions. (English) Zbl 1478.68446 Theory Comput. 15, Paper No. 1, 55 p. (2019). MSC: 68W20 06E30 68Q06 68Q25 68Q32 PDF BibTeX XML Cite \textit{C. L. Canonne} et al., Theory Comput. 15, Paper No. 1, 55 p. (2019; Zbl 1478.68446) Full Text: DOI OpenURL
Popkov, Kirill A. Short single tests for circuits with arbitrary stuck-at faults at outputs of gates. (English. Russian original) Zbl 1490.94087 Discrete Math. Appl. 29, No. 5, 321-333 (2019); translation from Diskretn. Mat. 30, No. 3, 99-116 (2018). MSC: 94C11 94C12 94D10 PDF BibTeX XML Cite \textit{K. A. Popkov}, Discrete Math. Appl. 29, No. 5, 321--333 (2019; Zbl 1490.94087); translation from Diskretn. Mat. 30, No. 3, 99--116 (2018) Full Text: DOI OpenURL
Sergeev, Igor’ S. On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates. (English. Russian original) Zbl 1439.94116 Discrete Math. Appl. 29, No. 4, 241-254 (2019); translation from Diskretn. Mat. 30, No. 2, 120-137 (2018). MSC: 94C11 68Q06 94D10 PDF BibTeX XML Cite \textit{I. S. Sergeev}, Discrete Math. Appl. 29, No. 4, 241--254 (2019; Zbl 1439.94116); translation from Diskretn. Mat. 30, No. 2, 120--137 (2018) Full Text: DOI OpenURL
Vlad, Serban Emilian On the generalized technical condition of proper operation of the Boolean asynchronous systems. (English) Zbl 1442.94066 Appl. Sci. 21, 253-263 (2019). MSC: 94C11 06E30 94C05 PDF BibTeX XML Cite \textit{S. E. Vlad}, Appl. Sci. 21, 253--263 (2019; Zbl 1442.94066) Full Text: Link OpenURL
Kulikov, Alexander S.; Podolskii, Vladimir V. Computing majority by constant depth majority circuits with low fan-in gates. (English) Zbl 1429.68082 Theory Comput. Syst. 63, No. 5, 956-986 (2019). MSC: 68Q25 68Q06 68Q17 68W20 94C11 PDF BibTeX XML Cite \textit{A. S. Kulikov} and \textit{V. V. Podolskii}, Theory Comput. Syst. 63, No. 5, 956--986 (2019; Zbl 1429.68082) Full Text: DOI Link OpenURL
Sakai, Takayuki; Seto, Kazuhisa; Tamaki, Suguru; Teruyama, Junichi Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression. (English) Zbl 1423.68218 J. Comput. Syst. Sci. 105, 87-103 (2019). MSC: 68Q25 68Q17 94C10 PDF BibTeX XML Cite \textit{T. Sakai} et al., J. Comput. Syst. Sci. 105, 87--103 (2019; Zbl 1423.68218) Full Text: DOI Link OpenURL
Kochergin, V. V.; Mikhaĭlovich, A. V. Exact value of the nonmonotone complexity of Boolean functions. (English. Russian original) Zbl 1411.94115 Math. Notes 105, No. 1, 28-35 (2019); translation from Mat. Zametki 105, No. 1, 32-41 (2019). MSC: 94C10 PDF BibTeX XML Cite \textit{V. V. Kochergin} and \textit{A. V. Mikhaĭlovich}, Math. Notes 105, No. 1, 28--35 (2019; Zbl 1411.94115); translation from Mat. Zametki 105, No. 1, 32--41 (2019) Full Text: DOI OpenURL
Amy, Matthew; Mosca, Michele T-count optimization and Reed-Muller codes. (English) Zbl 1432.94189 IEEE Trans. Inf. Theory 65, No. 8, 4771-4784 (2019). MSC: 94B25 94B35 94C11 PDF BibTeX XML Cite \textit{M. Amy} and \textit{M. Mosca}, IEEE Trans. Inf. Theory 65, No. 8, 4771--4784 (2019; Zbl 1432.94189) Full Text: DOI arXiv OpenURL
Xu, Wen-Li; Lee, Jia; Chen, Hui-Hui; Isokawa, Teijiro Universal computation in a simplified Brownian cellular automaton with von Neumann neighborhood. (English) Zbl 1455.68116 Fundam. Inform. 165, No. 2, 139-156 (2019). MSC: 68Q80 68Q06 94C11 PDF BibTeX XML Cite \textit{W.-L. Xu} et al., Fundam. Inform. 165, No. 2, 139--156 (2019; Zbl 1455.68116) Full Text: DOI OpenURL
Chen, Shiteng; Papakonstantinou, Periklis A. Depth reduction for composites. (English) Zbl 1421.68054 SIAM J. Comput. 48, No. 2, 668-686 (2019). MSC: 68Q15 68Q17 94C10 PDF BibTeX XML Cite \textit{S. Chen} and \textit{P. A. Papakonstantinou}, SIAM J. Comput. 48, No. 2, 668--686 (2019; Zbl 1421.68054) Full Text: DOI OpenURL
Romanov, Dmitry S.; Romanova, Elena Yu. A method of synthesis of irredundant circuits admitting single fault detection tests of constant length. (English. Russian original) Zbl 1454.94146 Discrete Math. Appl. 29, No. 1, 35-48 (2019); translation from Diskretn. Mat. 29, No. 4, 87-105 (2017). MSC: 94C05 94C11 94C12 PDF BibTeX XML Cite \textit{D. S. Romanov} and \textit{E. Yu. Romanova}, Discrete Math. Appl. 29, No. 1, 35--48 (2019; Zbl 1454.94146); translation from Diskretn. Mat. 29, No. 4, 87--105 (2017) Full Text: DOI OpenURL
Popkov, Kirill A. Lower bounds for the lengths of single tests for Boolean circuits. (English. Russian original) Zbl 1454.94145 Discrete Math. Appl. 29, No. 1, 23-33 (2019); translation from Diskretn. Mat. 29, No. 2, 53-69 (2017). MSC: 94C05 94C12 PDF BibTeX XML Cite \textit{K. A. Popkov}, Discrete Math. Appl. 29, No. 1, 23--33 (2019; Zbl 1454.94145); translation from Diskretn. Mat. 29, No. 2, 53--69 (2017) Full Text: DOI OpenURL
Boyar, Joan; Find, Magnus Gausdal; Peralta, René Small low-depth circuits for cryptographic applications. (English) Zbl 1420.94121 Cryptogr. Commun. 11, No. 1, 109-127 (2019). MSC: 94C10 94A60 PDF BibTeX XML Cite \textit{J. Boyar} et al., Cryptogr. Commun. 11, No. 1, 109--127 (2019; Zbl 1420.94121) Full Text: DOI Link OpenURL
Çalık, Çağdaş; Sönmez Turan, Meltem; Peralta, René The multiplicative complexity of 6-variable Boolean functions. (English) Zbl 1420.94044 Cryptogr. Commun. 11, No. 1, 93-107 (2019). MSC: 94D10 94A60 06E30 PDF BibTeX XML Cite \textit{Ç. Çalık} et al., Cryptogr. Commun. 11, No. 1, 93--107 (2019; Zbl 1420.94044) Full Text: DOI Link OpenURL
Jukna, Stasys; Seiwert, Hannes Greedy can beat pure dynamic programming. (English) Zbl 1469.68168 Inf. Process. Lett. 142, 90-95 (2019). MSC: 68W40 68R10 90C09 90C39 PDF BibTeX XML Cite \textit{S. Jukna} and \textit{H. Seiwert}, Inf. Process. Lett. 142, 90--95 (2019; Zbl 1469.68168) Full Text: DOI arXiv OpenURL
Amano, Kazuyuki Depth two majority circuits for majority and list expanders. (English) Zbl 07378398 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 81, 13 p. (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{K. Amano}, LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 81, 13 p. (2018; Zbl 07378398) Full Text: DOI OpenURL
Lingas, Andrzej Small normalized Boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth. (English) Zbl 1441.68042 Servedio, Rocco A. (ed.), 33rd computational complexity conference, CCC 2018, June 22–24, 2018, San Diego, California, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 102, Article 26, 10 p. (2018). MSC: 68Q06 68Q17 PDF BibTeX XML Cite \textit{A. Lingas}, LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 26, 10 p. (2018; Zbl 1441.68042) Full Text: DOI OpenURL
He, Tai-Ran; Lee, Jia; Isokawa, Teijiro Invertible construction of decimal-to-binary converter using reversible elements. (English) Zbl 1434.68159 Adamatzky, Andrew (ed.), Reversibility and universality. Essays presented to Kenichi Morita on the occasion of his 70th birthday. Cham: Springer. Emerg. Complex. Comput. 30, 169-181 (2018). MSC: 68Q06 94C11 PDF BibTeX XML Cite \textit{T.-R. He} et al., Emerg. Complex. Comput. 30, 169--181 (2018; Zbl 1434.68159) Full Text: DOI OpenURL
Agrawal, Manindra; Ghosh, Sumanta; Saxena, Nitin Bootstrapping variables in algebraic circuits. (English) Zbl 1427.68356 Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1166-1179 (2018). MSC: 68W20 68Q17 68Q25 94C11 PDF BibTeX XML Cite \textit{M. Agrawal} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 1166--1179 (2018; Zbl 1427.68356) Full Text: DOI OpenURL
Ikenmeyer, Christian; Komarath, Balagopal; Lenzen, Christoph; Lysikov, Vladimir; Mokhov, Andrey; Sreenivasaiah, Karteek On the complexity of hazard-free circuits. (English) Zbl 1428.94117 Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 878-889 (2018). MSC: 94C11 68Q06 68Q25 PDF BibTeX XML Cite \textit{C. Ikenmeyer} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 878--889 (2018; Zbl 1428.94117) Full Text: DOI Link OpenURL
Red’kin, Nikolay P. A generalization of Shannon function. (English. Russian original) Zbl 1454.94152 Discrete Math. Appl. 28, No. 5, 309-318 (2018); translation from Diskretn. Mat. 29, No. 2, 70-83 (2017). MSC: 94D10 PDF BibTeX XML Cite \textit{N. P. Red'kin}, Discrete Math. Appl. 28, No. 5, 309--318 (2018; Zbl 1454.94152); translation from Diskretn. Mat. 29, No. 2, 70--83 (2017) Full Text: DOI OpenURL
Grabovskaya, S. M.; Alekhina, M. A. An upper bound of unreliability of non-branching programs in an arbitrary complete finite basis for one-type constant faults at the outputs of computational operators. (English) Zbl 1430.94120 Lobachevskii J. Math. 39, No. 9, 1332-1342 (2018). MSC: 94C12 94C05 68M15 PDF BibTeX XML Cite \textit{S. M. Grabovskaya} and \textit{M. A. Alekhina}, Lobachevskii J. Math. 39, No. 9, 1332--1342 (2018; Zbl 1430.94120) Full Text: DOI OpenURL
Frantseva, Anastasiya Sergeevna An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits. (Russian. English summary) Zbl 1409.94950 Izv. Irkutsk. Gos. Univ., Ser. Mat. 25, 144-158 (2018). MSC: 94C10 68Q25 PDF BibTeX XML Cite \textit{A. S. Frantseva}, Izv. Irkutsk. Gos. Univ., Ser. Mat. 25, 144--158 (2018; Zbl 1409.94950) Full Text: DOI Link OpenURL
Williams, R. Ryan New algorithms and lower bounds for circuits with linear threshold gates. (English) Zbl 1410.68127 Theory Comput. 14, Paper No. 17, 25 p. (2018). MSC: 68Q05 68Q17 68Q25 68W40 94C10 PDF BibTeX XML Cite \textit{R. R. Williams}, Theory Comput. 14, Paper No. 17, 25 p. (2018; Zbl 1410.68127) Full Text: DOI arXiv OpenURL
Kopparty, Swastik; Srinivasan, Srikanth Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression. (English) Zbl 1412.68071 Theory Comput. 14, Paper No. 12, 24 p. (2018). MSC: 68Q17 68Q15 94C10 PDF BibTeX XML Cite \textit{S. Kopparty} and \textit{S. Srinivasan}, Theory Comput. 14, Paper No. 12, 24 p. (2018; Zbl 1412.68071) Full Text: DOI OpenURL