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
Beyersdorff, Olaf; Blinkhorn, Joshua; Mahajan, Meena Hardness characterisations and size-width lower bounds for QBF resolution. (English) Zbl 07299470 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) (ISBN 978-1-4503-7104-9). 209-223 (2020). MSC: 03F20 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 07299470) Full Text: DOI
Red’kin, N. P. Minimal contact circuits for symmetric threshold functions. (English. Russian original) Zbl 07270834 Math. Notes 108, No. 3, 370-380 (2020); translation from Mat. Zametki 108, No. 3, 397-411 (2020). MSC: 94C PDF BibTeX XML Cite \textit{N. P. Red'kin}, Math. Notes 108, No. 3, 370--380 (2020; Zbl 07270834); translation from Mat. Zametki 108, No. 3, 397--411 (2020) Full Text: DOI
Dinesh, Krishnamoorthy; Otiv, Samir; Sarma, Jayalal New bounds for energy complexity of Boolean functions. (English) Zbl 07264846 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 07264846) Full Text: DOI
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
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
Curzi, Gianluca; Roversi, Luca A type-assignment of linear erasure and duplication. (English) Zbl 07239089 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 07239089) Full Text: DOI
Popkov, Kirill A. On diagnostic tests of contact break for contact circuits. (English. Russian original) Zbl 07226065 Discrete Math. Appl. 30, No. 2, 103-116 (2020); translation from Diskretn. Mat. 31, No. 2, 123-142 (2019). MSC: 94C10 94D10 PDF BibTeX XML Cite \textit{K. A. Popkov}, Discrete Math. Appl. 30, No. 2, 103--116 (2020; Zbl 07226065); translation from Diskretn. Mat. 31, No. 2, 123--142 (2019) Full Text: DOI
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
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
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
Engels, Christian; Garg, Mohit; Makino, Kazuhisa; Rao, Anup On expressing majority as a majority of majorities. (English) Zbl 07182606 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 07182606) Full Text: DOI
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
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
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 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
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
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 07311667 Prikl. Diskretn. Mat. 2019, No. 45, 44-54 (2019). MSC: 94C 62 PDF BibTeX XML Cite \textit{M. A. Alekhina} et al., Prikl. Diskretn. Mat. 2019, No. 45, 44--54 (2019; Zbl 07311667) Full Text: DOI MNR
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)
Alekhina, M.; Barsukova, O.; Shornikova, T. About the reliability of circuits in the complete finite basis containing an essential linear function. (English) Zbl 07266208 Lobachevskii J. Math. 40, No. 12, 2027-2033 (2019). MSC: 94C10 60 PDF BibTeX XML Cite \textit{M. Alekhina} et al., Lobachevskii J. Math. 40, No. 12, 2027--2033 (2019; Zbl 07266208) Full Text: DOI
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
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 (ISBN 978-3-030-26175-7/pbk; 978-3-030-26176-4/ebook). Lecture Notes in Computer Science 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
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
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: Link
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
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
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
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
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
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
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
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
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
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
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
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
Ç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: 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
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
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
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
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
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
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
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
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
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
Sherstov, Alexander A. The power of asymmetry in constant-depth circuits. (English) Zbl 1427.68079 SIAM J. Comput. 47, No. 6, 2362-2434 (2018). MSC: 68Q06 68Q11 68Q32 PDF BibTeX XML Cite \textit{A. A. Sherstov}, SIAM J. Comput. 47, No. 6, 2362--2434 (2018; Zbl 1427.68079) Full Text: DOI
Rychkov, K. L. Complexity of the realization of a linear Boolean function in the class of \(\pi\)-schemes. (Russian, English) Zbl 1413.94077 Diskretn. Anal. Issled. Oper. 25, No. 3, 36-94 (2018); translation in J. Appl. Ind. Math. 12, No. 3, 540-576 (2018). MSC: 94C05 68Q17 PDF BibTeX XML Cite \textit{K. L. Rychkov}, Diskretn. Anal. Issled. Oper. 25, No. 3, 36--94 (2018; Zbl 1413.94077); translation in J. Appl. Ind. Math. 12, No. 3, 540--576 (2018) Full Text: DOI
Rossman, Benjamin Formulas versus circuits for small distance connectivity. (English) Zbl 1402.68076 SIAM J. Comput. 47, No. 5, 1986-2028 (2018). MSC: 68Q17 68Q05 94C10 PDF BibTeX XML Cite \textit{B. Rossman}, SIAM J. Comput. 47, No. 5, 1986--2028 (2018; Zbl 1402.68076) Full Text: DOI
Kochergin, V. V.; Mikhaĭlovich, A. V. On the complexity of multivalued logic functions over some infinite basis. (Russian, English) Zbl 1413.94079 Diskretn. Anal. Issled. Oper. 25, No. 1, 42-74 (2018); translation in J. Appl. Ind. Math. 12, No. 1, 40-58 (2018). MSC: 94C10 PDF BibTeX XML Cite \textit{V. V. Kochergin} and \textit{A. V. Mikhaĭlovich}, Diskretn. Anal. Issled. Oper. 25, No. 1, 42--74 (2018; Zbl 1413.94079); translation in J. Appl. Ind. Math. 12, No. 1, 40--58 (2018) Full Text: DOI
Cheraghchi, Mahdi; Grigorescu, Elena; Juba, Brendan; Wimmer, Karl; Xie, Ning \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product. (English) Zbl 1398.68159 J. Comput. Syst. Sci. 97, 45-59 (2018). MSC: 68Q05 68Q17 94C10 PDF BibTeX XML Cite \textit{M. Cheraghchi} et al., J. Comput. Syst. Sci. 97, 45--59 (2018; Zbl 1398.68159) Full Text: DOI
Chashkin, Aleksandr V. On the average-case complexity of underdetermined functions. (English. Russian original) Zbl 1393.68070 Discrete Math. Appl. 28, No. 4, 201-221 (2018); translation from Diskretn. Mat. 29, No. 2, 133-159 (2017). MSC: 68Q25 68P05 94C10 PDF BibTeX XML Cite \textit{A. V. Chashkin}, Discrete Math. Appl. 28, No. 4, 201--221 (2018; Zbl 1393.68070); translation from Diskretn. Mat. 29, No. 2, 133--159 (2017) Full Text: DOI
De Vos, Alexis; De Baerdemacker, Stijn; Van Rentergem, Yvan Synthesis of quantum circuits vs. synthesis of classical reversible circuits. (English) Zbl 1405.81006 Synthesis Lectures on Digital Circuits and Systems 54. San Rafael, CA: Morgan & Claypool Publishers (ISBN 978-1-68173-379-1/pbk; 978-1-68173-381-4/hbk; 978-1-68173-380-7/ebook). xv, 109 p. (2018). Reviewer: Liviu Goraş (Iaşi) MSC: 81-02 94-02 81P68 94C10 PDF BibTeX XML Cite \textit{A. De Vos} et al., Synthesis of quantum circuits vs. synthesis of classical reversible circuits. San Rafael, CA: Morgan \& Claypool Publishers (2018; Zbl 1405.81006) Full Text: DOI
Hu, Yuchong; Lee, Patrick P. C.; Shum, Kenneth W.; Zhou, Pan Proxy-assisted regenerating codes with uncoded repair for distributed storage systems. (English) Zbl 1390.94683 IEEE Trans. Inf. Theory 64, No. 4, Part 1, 2512-2528 (2018). MSC: 94A29 94C05 94C10 PDF BibTeX XML Cite \textit{Y. Hu} et al., IEEE Trans. Inf. Theory 64, No. 4, Part 1, 2512--2528 (2018; Zbl 1390.94683) Full Text: DOI
Chen, Ruiwen; Santhanam, Rahul; Srinivasan, Srikanth Average-case lower bounds and satisfiability algorithms for small threshold circuits. (English) Zbl 1395.68138 Theory Comput. 14, Paper No. 9, 55 p. (2018). MSC: 68Q17 68Q05 68T20 94C10 PDF BibTeX XML Cite \textit{R. Chen} et al., Theory Comput. 14, Paper No. 9, 55 p. (2018; Zbl 1395.68138) Full Text: DOI
Golovnev, Alexander; Hirsch, Edward A.; Knop, Alexander; Kulikov, Alexander S. On the limits of gate elimination. (English) Zbl 1393.68061 J. Comput. Syst. Sci. 96, 107-119 (2018). MSC: 68Q17 68Q05 94C10 PDF BibTeX XML Cite \textit{A. Golovnev} et al., J. Comput. Syst. Sci. 96, 107--119 (2018; Zbl 1393.68061) Full Text: DOI
Kawachi, Akinori Circuit lower bounds from learning-theoretic approaches. (English) Zbl 1393.68152 Theor. Comput. Sci. 733, 83-98 (2018). MSC: 68T05 68Q17 94C10 PDF BibTeX XML Cite \textit{A. Kawachi}, Theor. Comput. Sci. 733, 83--98 (2018; Zbl 1393.68152) Full Text: DOI
Golovnev, Alexander; Kulikov, Alexander S.; Smal, Alexander V.; Tamaki, Suguru Gate elimination: circuit size lower bounds and #SAT upper bounds. (English) Zbl 1388.68117 Theor. Comput. Sci. 719, 46-63 (2018). MSC: 68Q25 68Q17 94C10 PDF BibTeX XML Cite \textit{A. Golovnev} et al., Theor. Comput. Sci. 719, 46--63 (2018; Zbl 1388.68117) Full Text: DOI
Hrubeš, Pavel; Pudlák, Pavel A note on monotone real circuits. (English) Zbl 1422.68115 Inf. Process. Lett. 131, 15-19 (2018). MSC: 68Q25 94C10 PDF BibTeX XML Cite \textit{P. Hrubeš} and \textit{P. Pudlák}, Inf. Process. Lett. 131, 15--19 (2018; Zbl 1422.68115) Full Text: DOI
Impagliazzo, Russell; Kabanets, Valentine; Kolokolova, Antonina; McKenzie, Pierre; Romani, Shadab Does looking inside a circuit help? (English) Zbl 1440.68079 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 1, 13 p. (2017). MSC: 68Q06 68R07 94C11 PDF BibTeX XML Cite \textit{R. Impagliazzo} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 1, 13 p. (2017; Zbl 1440.68079) Full Text: DOI
Oliveira, Igor C.; Santhanam, Rahul Conspiracies between learning algorithms, circuit lower bounds, and pseudorandomness. (English) Zbl 1440.68083 O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 18, 49 p. (2017). MSC: 68Q06 68Q15 68Q17 68Q32 68Q87 PDF BibTeX XML Cite \textit{I. C. Oliveira} and \textit{R. Santhanam}, LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 18, 49 p. (2017; Zbl 1440.68083) Full Text: DOI
Tal, Avishay Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\). (English) Zbl 1440.68084 O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 15, 31 p. (2017). MSC: 68Q06 68Q15 94C11 PDF BibTeX XML Cite \textit{A. Tal}, LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 15, 31 p. (2017; Zbl 1440.68084) Full Text: DOI
Aledo, Juan A.; Diaz, Luis G.; Martinez, Silvia; Valverde, Jose C. On periods and equilibria of computational sequential systems. (English) Zbl 1429.68167 Inf. Sci. 409-410, 27-34 (2017). MSC: 68R10 37B15 37E15 68Q06 PDF BibTeX XML Cite \textit{J. A. Aledo} et al., Inf. Sci. 409--410, 27--34 (2017; Zbl 1429.68167) Full Text: DOI
Baumann, Ringo; Strass, Hannes On the number of bipolar Boolean functions. (English) Zbl 1404.06012 J. Log. Comput. 27, No. 8, 2431-2449 (2017). MSC: 06E30 05A15 PDF BibTeX XML Cite \textit{R. Baumann} and \textit{H. Strass}, J. Log. Comput. 27, No. 8, 2431--2449 (2017; Zbl 1404.06012) Full Text: DOI
Pasalic, E.; Chattopadhyay, A.; Chowdhury, D. An analysis of root functions – a subclass of the impossible class of faulty functions (ICFF). (English) Zbl 1397.94133 Discrete Appl. Math. 222, 1-13 (2017). MSC: 94C10 90B10 94C05 PDF BibTeX XML Cite \textit{E. Pasalic} et al., Discrete Appl. Math. 222, 1--13 (2017; Zbl 1397.94133) Full Text: DOI
Find, Magnus Gausdal; Smith-Tone, Daniel; Sönmez Turan, Meltem The number of Boolean functions with multiplicative complexity 2. (English) Zbl 1407.94195 Int. J. Inf. Coding Theory 4, No. 4, 222-236 (2017). MSC: 94C10 94A60 PDF BibTeX XML Cite \textit{M. G. Find} et al., Int. J. Inf. Coding Theory 4, No. 4, 222--236 (2017; Zbl 1407.94195) Full Text: DOI
Håstad, Johan; Rossman, Benjamin; Servedio, Rocco A.; Tan, Li-Yang An average-case depth hierarchy theorem for Boolean circuits. (English) Zbl 1426.68098 J. ACM 64, No. 5, Paper No. 35, 27 p. (2017). MSC: 68Q15 94C11 PDF BibTeX XML Cite \textit{J. Håstad} et al., J. ACM 64, No. 5, Paper No. 35, 27 p. (2017; Zbl 1426.68098) Full Text: DOI
Potechin, Aaron Bounds on monotone switching networks for directed connectivity. (English) Zbl 1426.68104 J. ACM 64, No. 4, Article No. 29, 48 p. (2017). MSC: 68Q17 05C40 68Q06 68Q15 94C11 PDF BibTeX XML Cite \textit{A. Potechin}, J. ACM 64, No. 4, Article No. 29, 48 p. (2017; Zbl 1426.68104) Full Text: DOI
Servedio, Rocco A.; Tan, Li-Yang What circuit classes can be learned with non-trivial savings? (English) Zbl 1402.68112 Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 30, 21 p. (2017). MSC: 68Q32 94C10 PDF BibTeX XML Cite \textit{R. A. Servedio} and \textit{L.-Y. Tan}, LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 30, 21 p. (2017; Zbl 1402.68112) Full Text: DOI
Aaronson, Scott; Grier, Daniel; Schaeffer, Luke The classification of reversible bit operations. (English) Zbl 1404.68042 Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 23, 34 p. (2017). MSC: 68Q05 81P68 94C10 PDF BibTeX XML Cite \textit{S. Aaronson} et al., LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 23, 34 p. (2017; Zbl 1404.68042) Full Text: DOI
Kochergin, Vadim V.; Mikhaĭlovich, Anna V. The minimum number of negations in circuits for systems of multi-valued functions. (English. Russian original) Zbl 1441.94117 Discrete Math. Appl. 27, No. 5, 295-302 (2017); translation from Diskretn. Mat. 28, No. 4, 80-90 (2016). MSC: 94C11 03B50 PDF BibTeX XML Cite \textit{V. V. Kochergin} and \textit{A. V. Mikhaĭlovich}, Discrete Math. Appl. 27, No. 5, 295--302 (2017; Zbl 1441.94117); translation from Diskretn. Mat. 28, No. 4, 80--90 (2016) Full Text: DOI
Kulikov, Alexander S.; Podolskii, Vladimir V. Computing majority by constant depth majority circuits with low fan-in gates. (English) Zbl 1402.68100 Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 49, 14 p. (2017). MSC: 68Q25 68Q10 68Q17 68W20 94C10 PDF BibTeX XML Cite \textit{A. S. Kulikov} and \textit{V. V. Podolskii}, LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 49, 14 p. (2017; Zbl 1402.68100) Full Text: DOI
Chistikov, Dmitry; Iván, Szabolcs; Lubiw, Anna; Shallit, Jeffrey Fractional coverings, greedy coverings, and rectifier networks. (English) Zbl 1402.68086 Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 23, 14 p. (2017). MSC: 68Q25 15B34 68Q17 68R10 PDF BibTeX XML Cite \textit{D. Chistikov} et al., LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 23, 14 p. (2017; Zbl 1402.68086) Full Text: DOI
Popkov, K. A. On the exact value of the length of the minimal single diagnostic test for a particular class of circuits. (Russian, English) Zbl 1399.93061 Diskretn. Anal. Issled. Oper. 24, No. 3, 80-103 (2017); translation in J. Appl. Ind. Math. 11, No. 3, 431-443 (2017). MSC: 93B50 94C12 94C10 PDF BibTeX XML Cite \textit{K. A. Popkov}, Diskretn. Anal. Issled. Oper. 24, No. 3, 80--103 (2017; Zbl 1399.93061); translation in J. Appl. Ind. Math. 11, No. 3, 431--443 (2017) Full Text: DOI
Kole, Abhoy; Wille, Robert; Datta, Kamalika; Sengupta, Indranil Test pattern generation effort evaluation of reversible circuits. (English) Zbl 06850921 Phillips, Iain (ed.) et al., Reversible computation. 9th international conference, RC 2017, Kolkata, India, July 6–7, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-59935-9/pbk; 978-3-319-59936-6/ebook). Lecture Notes in Computer Science 10301, 162-175 (2017). MSC: 68Q05 68Q10 81P68 94C10 PDF BibTeX XML Cite \textit{A. Kole} et al., Lect. Notes Comput. Sci. 10301, 162--175 (2017; Zbl 06850921) Full Text: DOI
Aditya, Kunwar Design and characteristics of series-series and series-parallel topologies fed from constant-voltage fixed-frequency supply. (English) Zbl 1378.94085 Sādhanā 42, No. 2, 163-171 (2017). MSC: 94C10 PDF BibTeX XML Cite \textit{K. Aditya}, Sādhanā 42, No. 2, 163--171 (2017; Zbl 1378.94085) Full Text: DOI
Sun, Changchun; Chen, Zhongtang; Xu, Qicheng Generating a double-scroll attractor by connecting a pair of mutual mirror-image attractors via planar switching control. (English) Zbl 1382.37026 Int. J. Bifurcation Chaos Appl. Sci. Eng. 27, No. 13, Article ID 1750197, 16 p. (2017). MSC: 37C70 34C28 94C10 PDF BibTeX XML Cite \textit{C. Sun} et al., Int. J. Bifurcation Chaos Appl. Sci. Eng. 27, No. 13, Article ID 1750197, 16 p. (2017; Zbl 1382.37026) Full Text: DOI
Red’kin, N. P. On the length of diagnostic tests for Boolean circuits. (English. Russian original) Zbl 1425.94090 Math. Notes 102, No. 4, 580-582 (2017); translation from Mat. Zametki 102, No. 4, 624-627 (2017). MSC: 94C10 94C12 PDF BibTeX XML Cite \textit{N. P. Red'kin}, Math. Notes 102, No. 4, 580--582 (2017; Zbl 1425.94090); translation from Mat. Zametki 102, No. 4, 624--627 (2017) Full Text: DOI
Niemann, Philipp; Wille, Robert Compact representations for the design of quantum logic. (English) Zbl 1374.81002 SpringerBriefs in Physics. Cham: Springer (ISBN 978-3-319-63723-5/pbk; 978-3-319-63724-2/ebook). viii, 125 p. (2017). MSC: 81-02 81P68 68Q12 03G12 PDF BibTeX XML Cite \textit{P. Niemann} and \textit{R. Wille}, Compact representations for the design of quantum logic. Cham: Springer (2017; Zbl 1374.81002) Full Text: DOI
Zakablukov, Dmitry V. On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates. (English. Russian original) Zbl 1422.94054 Discrete Math. Appl. 27, No. 1, 57-67 (2017); translation from Diskretn. Mat. 28, No. 2, 12-26 (2016). MSC: 94C10 68Q05 PDF BibTeX XML Cite \textit{D. V. Zakablukov}, Discrete Math. Appl. 27, No. 1, 57--67 (2017; Zbl 1422.94054); translation from Diskretn. Mat. 28, No. 2, 12--26 (2016) Full Text: DOI
Allender, Eric; Gál, Anna; Mertz, Ian Dual VP classes. (English) Zbl 1378.68046 Comput. Complexity 26, No. 3, 583-625 (2017). MSC: 68Q15 94C10 PDF BibTeX XML Cite \textit{E. Allender} et al., Comput. Complexity 26, No. 3, 583--625 (2017; Zbl 1378.68046) Full Text: DOI
Murray, Cody D.; Williams, R. Ryan On the (non) \(\mathsf{NP}\)-hardness of computing circuit complexity. (English) Zbl 1378.68053 Theory Comput. 13, Paper No. 4, 22 p. (2017). MSC: 68Q17 68Q15 94C10 PDF BibTeX XML Cite \textit{C. D. Murray} and \textit{R. R. Williams}, Theory Comput. 13, Paper No. 4, 22 p. (2017; Zbl 1378.68053) Full Text: DOI
Allender, Eric; Das, Bireswar Zero knowledge and circuit minimization. (English) Zbl 1376.68056 Inf. Comput. 256, 2-8 (2017). MSC: 68Q25 05C60 68Q15 94C10 PDF BibTeX XML Cite \textit{E. Allender} and \textit{B. Das}, Inf. Comput. 256, 2--8 (2017; Zbl 1376.68056) Full Text: DOI
Chen, Xi; Oliveira, Igor C.; Servedio, Rocco A. Addition is exponentially harder than counting for shallow monotone circuits. (English) Zbl 1370.94608 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 1232-1245 (2017). MSC: 94C10 68Q25 PDF BibTeX XML Cite \textit{X. Chen} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 1232--1245 (2017; Zbl 1370.94608) Full Text: DOI arXiv
Alman, Josh; Williams, Ryan Probabilistic rank and matrix rigidity. (English) Zbl 1369.68212 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 641-652 (2017). MSC: 68Q17 15A03 15B34 65T50 68Q05 94C10 PDF BibTeX XML Cite \textit{J. Alman} and \textit{R. Williams}, in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 641--652 (2017; Zbl 1369.68212) Full Text: DOI
Kabanets, Valentine; Kane, Daniel M.; Lu, Zhenjian A polynomial restriction lemma with applications. (English) Zbl 1370.68223 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 615-628 (2017). MSC: 68Q87 68Q10 68Q17 94C10 PDF BibTeX XML Cite \textit{V. Kabanets} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 615--628 (2017; Zbl 1370.68223) Full Text: DOI
Nahin, Paul J. The logician and the engineer. How George Boole and Claude Shannon created the information age. Reprint of the 2013 hardback edition. (English) Zbl 1366.94003 Princeton, NJ: Princeton University Press (ISBN 978-0-691-17600-0/pbk; 978-1-4008-4465-4/ebook). xii, 228 p. (2017). MSC: 94-03 01A55 01A60 01A70 94-01 94A15 94A17 94A24 94C10 PDF BibTeX XML Cite \textit{P. J. Nahin}, The logician and the engineer. How George Boole and Claude Shannon created the information age. Reprint of the 2013 hardback edition. Princeton, NJ: Princeton University Press (2017; Zbl 1366.94003) Full Text: DOI
Anderson, Matthew; Dawar, Anuj On symmetric circuits and fixed-point logics. (English) Zbl 1366.68047 Theory Comput. Syst. 60, No. 3, 521-551 (2017). MSC: 68Q05 03B70 94C10 PDF BibTeX XML Cite \textit{M. Anderson} and \textit{A. Dawar}, Theory Comput. Syst. 60, No. 3, 521--551 (2017; Zbl 1366.68047) Full Text: DOI
Zhang, Jiancheng; Zhu, Fanglai; Zhao, Xudong; Wang, Fengning Robust impulsive reset observers of a class of switched nonlinear systems with unknown inputs. (English) Zbl 1364.93103 J. Franklin Inst. 354, No. 7, 2924-2943 (2017). MSC: 93B07 93C30 93C10 94C10 PDF BibTeX XML Cite \textit{J. Zhang} et al., J. Franklin Inst. 354, No. 7, 2924--2943 (2017; Zbl 1364.93103) Full Text: DOI
Lingas, Andrzej Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution. (English) Zbl 06721533 Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-55910-0/pbk; 978-3-319-55911-7/ebook). Lecture Notes in Computer Science 10185, 401-411 (2017). MSC: 68Q05 PDF BibTeX XML Cite \textit{A. Lingas}, Lect. Notes Comput. Sci. 10185, 401--411 (2017; Zbl 06721533) Full Text: DOI
Zakablukov, Dmitry V. On asymptotic gate complexity and depth of reversible circuits without additional memory. (English) Zbl 1391.94921 J. Comput. Syst. Sci. 84, 132-143 (2017). MSC: 94C10 68Q25 20B05 68Q12 PDF BibTeX XML Cite \textit{D. V. Zakablukov}, J. Comput. Syst. Sci. 84, 132--143 (2017; Zbl 1391.94921) Full Text: DOI
Salibra, Antonino; Manzonetto, Giulio; Favro, Giordano Factor varieties and symbolic computation. (English) Zbl 1394.03019 Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 739-748 (2016). MSC: 03B35 03B05 03B10 03B50 03G25 08B05 68Q42 94C10 PDF BibTeX XML Cite \textit{A. Salibra} et al., in: Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5--8, 2016. New York, NY: Association for Computing Machinery (ACM). 739--748 (2016; Zbl 1394.03019) Full Text: DOI
Sakai, Takayuki; Seto, Kazuhisa; Tamaki, Suguru; Teruyama, Junichi Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression. (English) Zbl 1398.68259 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 82, 16 p. (2016). MSC: 68Q25 68Q17 94C10 PDF BibTeX XML Cite \textit{T. Sakai} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 82, 16 p. (2016; Zbl 1398.68259) Full Text: DOI
Golovnev, Alexander; Hirsch, Edward A.; Knop, Alexander; Kulikov, Alexander S. On the limits of gate elimination. (English) Zbl 1393.68060 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 46, 13 p. (2016). MSC: 68Q17 68Q05 94C10 PDF BibTeX XML Cite \textit{A. Golovnev} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 46, 13 p. (2016; Zbl 1393.68060) Full Text: DOI
Golovnev, Alexander; Kulikov, Alexander S.; Smal, Alexander V.; Tamaki, Suguru Circuit size lower bounds and #SAT upper bounds through a general framework. (English) Zbl 1398.68193 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 45, 16 p. (2016). MSC: 68Q17 68Q25 94C10 PDF BibTeX XML Cite \textit{A. Golovnev} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 45, 16 p. (2016; Zbl 1398.68193) Full Text: DOI
Cheraghchi, Mahdi; Grigorescu, Elena; Juba, Brendan; Wimmer, Karl; Xie, Ning \(\mathrm{AC}^0\circ\mathrm{MOD}_2\) lower bounds for the Boolean inner product. (English) Zbl 1388.68084 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 35, 14 p. (2016). MSC: 68Q17 PDF BibTeX XML Cite \textit{M. Cheraghchi} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 35, 14 p. (2016; Zbl 1388.68084) Full Text: DOI
Chen, Ruiwen; Santhanam, Rahul; Srinivasan, Srikanth Average-case lower bounds and satisfiability algorithms for small threshold circuits. (English) Zbl 1380.68191 Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 1, 35 p. (2016). MSC: 68Q17 68Q05 68T20 94C10 PDF BibTeX XML Cite \textit{R. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 50, Article 1, 35 p. (2016; Zbl 1380.68191) Full Text: DOI
Kane, Daniel M.; Williams, Ryan Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits. (English) Zbl 1373.68220 Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 633-643 (2016). MSC: 68Q05 68Q17 94C10 PDF BibTeX XML Cite \textit{D. M. Kane} and \textit{R. Williams}, in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 633--643 (2016; Zbl 1373.68220) Full Text: DOI
Selezneva, Svetlana N. On the multiplicative complexity of Boolean functions. (English) Zbl 1395.94405 Fundam. Inform. 145, No. 3, 399-404 (2016). MSC: 94C10 PDF BibTeX XML Cite \textit{S. N. Selezneva}, Fundam. Inform. 145, No. 3, 399--404 (2016; Zbl 1395.94405) Full Text: DOI
Zhang, Zhen; Duan, Zhemin; Long, Ying Fault diagnosis of switched current circuit based on wavelet transform and support vector machine. (Chinese. English summary) Zbl 1374.94967 J. Nanjing Univ. Aeronaut. Astronaut. 48, No. 5, 744-752 (2016). MSC: 94C12 94C10 42C40 68T05 PDF BibTeX XML Cite \textit{Z. Zhang} et al., J. Nanjing Univ. Aeronaut. Astronaut. 48, No. 5, 744--752 (2016; Zbl 1374.94967) Full Text: DOI
Avrutin, Viktor; Zhusubaliyev, Zhanybai T.; Mosekilde, Erik Border collisions inside the stability domain of a fixed point. (English) Zbl 1364.94790 Physica D 321-322, 1-15 (2016). MSC: 94C05 94C10 37E05 37N20 37G10 37M05 PDF BibTeX XML Cite \textit{V. Avrutin} et al., Physica D 321--322, 1--15 (2016; Zbl 1364.94790) Full Text: DOI