×

Found 1,114 Documents (Results 1–100)

Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model. (English. Russian original) Zbl 07858825

Discrete Math. Appl. 34, No. 2, 103-115 (2024); translation from Diskretn. Mat. 34, No. 4, 52-68 (2022).
MSC:  94Cxx 68Qxx 94Axx
PDFBibTeX XMLCite
Full Text: DOI

Optimizing the depth of quantum implementations of linear layers. (English) Zbl 1530.81060

Deng, Yi (ed.) et al., Information security and cryptology. 18th International conference, Inscrypt 2022, Beijing, China, December 11–13, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13837, 129-147 (2023).
PDFBibTeX XMLCite
Full Text: DOI

Advanced Boolean techniques. Selected papers from the 15th international workshop on Boolean problems, IWSBP, Bremen, Germany, September 22–23, 2022. (English) Zbl 1530.94004

Cham: Springer (ISBN 978-3-031-28915-6/hbk; 978-3-031-28918-7/pbk; 978-3-031-28916-3/ebook). viii, 172 p. (2023).
PDFBibTeX XMLCite
Full Text: DOI

Lower bounds for monotone \(q\)-multilinear Boolean circuits. (English) Zbl 1528.94128

Gąsieniec, Leszek (ed.), SOFSEM 2023: theory and practice of computer science. 48th international conference on current trends in theory and practice of computer science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13878, 301-312 (2023).
MSC:  94C11
PDFBibTeX XMLCite
Full Text: DOI

The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. (English) Zbl 07774392

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 962-975 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Deriving approximate logic circuits for TMR technique. (English. Russian original) Zbl 1520.81039

Russ. Phys. J. 65, No. 4, 751-760 (2022); translation from Izv. Vyssh. Uchebn. Zaved., Fiz. 65, No. 4, 150-159 (2022).
PDFBibTeX XMLCite
Full Text: DOI

Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs. (English. Russian original) Zbl 1509.94179

Discrete Math. Appl. 32, No. 6, 439-444 (2022); translation from Diskretn. Mat. 33, No. 3, 46-54 (2021); retraction note Discrete Math. Appl. 32, No. 6, 418 (2022).
MSC:  94C11 68Q06
PDFBibTeX XMLCite

On the complexity of implementation of characteristic functions of the spheres by circuits of functional elements. (English. Russian original) Zbl 1507.94076

Mosc. Univ. Math. Bull. 77, No. 3, 127-130 (2022); translation from Vestn. Mosk. Univ., Ser. I 77, No. 3, 18-20 (2022).
MSC:  94C11 68Q06 94D10
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

Functional lower bounds for restricted arithmetic circuits of depth four. (English) Zbl 07799592

Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 14, 15 p. (2021).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hybrid quantum-classical circuit simplification with the ZX-calculus. (English) Zbl 1507.68114

Oh, Hakjoo (ed.), Programming languages and systems. 19th Asian symposium, APLAS 2021, Chicago, IL, USA, October 17–18, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13008, 121-139 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Lower bound of the length of a single fault diagnostic test with respect to insertions of a mod-2 adder. (English. Russian original) Zbl 1504.94250

Comput. Math. Model. 32, No. 4, 500-504 (2021); translation from Prikl. Mat. Inf. 68, 88-96 (2021).
MSC:  94C12 94C11
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

Exponential quantum communication reductions from generalizations of the Boolean hidden matching problem. (English) Zbl 1507.81058

Flammia, Steven T. (ed.), 15th conference on the theory of quantum computation, communication and cryptography, TQC 2020, Riga, Latvia, June 9–12, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 158, Article 1, 16 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI Link

Commutative automata networks. (English) Zbl 1530.68141

Zenil, Hector (ed.), Cellular automata and discrete complex systems. 26th IFIP WG 1.5 international workshop, AUTOMATA 2020, Stockholm, Sweden, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12286, 43-58 (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
MSC:  94C11 68Q06 94D10
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software