×

Found 1,042 Documents (Results 1–100)

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

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
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
PDF BibTeX XML Cite
Full Text: DOI

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
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
PDF BibTeX XML Cite
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
PDF BibTeX XML Cite
Full Text: DOI

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
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
PDF BibTeX XML Cite
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
PDF BibTeX XML Cite
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
PDF BibTeX XML Cite
Full Text: DOI

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
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).
PDF BibTeX XML Cite
Full Text: DOI

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
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
PDF BibTeX XML Cite
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).
PDF BibTeX XML Cite
Full Text: DOI

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

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
PDF BibTeX XML Cite
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
PDF BibTeX XML Cite
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
PDF BibTeX XML Cite
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
PDF BibTeX XML Cite
Full Text: DOI

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

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

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

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

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).
PDF BibTeX XML Cite
Full Text: DOI

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

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

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

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).
PDF BibTeX XML Cite
Full Text: DOI

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

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software