×

Found 27 Documents (Results 1–27)

100
MathJax

Lower bounds for depth three arithmetic circuits with small bottom fanin. (English) Zbl 1388.68089

Zuckerman, David (ed.), 30th conference on computational complexity, CCC’15, Portland, OR, USA, June 17–19, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-81-1). LIPIcs – Leibniz International Proceedings in Informatics 33, 158-208 (2015).
MSC:  68Q17 68Q05 68Q10
PDF BibTeX XML Cite
Full Text: DOI

Blackbox identity testing for bounded top fanin depth-3 circuits, the field doesn’t matter. (English) Zbl 1288.68138

Proceedings of the 43rd annual ACM symposium on theory of computing, STOC ’11. San Jose, CA, USA, June 6–8, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0691-1). 431-440 (2011).
MSC:  68Q25 12Y05 68W30 94C10 94C12
PDF BibTeX XML Cite
Full Text: DOI

Influence of the driver and active load threshold voltage in design of pseudo-NMOS logic. (English) Zbl 1231.94099

Mastorakis, N. (ed.) et al., Latest trends on circuits. Papers based on the presentations at the 14th WSEAS international conference on circuits (Part of the 14th WSEAS CSCC multiconference), Corfu Island, Greece, July 22–24, 2010. Athens: World Scientific and Engineering Academy and Society (WSEAS) (ISBN 978-960-474-206-6/CD-ROM; 978-960-474-198-4). 110-115 (2010).
MSC:  94C10 94C30
PDF BibTeX XML Cite

Computing symmetric functions with AND/OR circuits and a single MAJORITY gate. (English) Zbl 0796.94020

Enjalbert, Patrice (ed.) et al., STACS 93. 10th annual symposium on theoretical aspects of computer science, Würzburg, Germany, February 25-27, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 665, 535-544 (1993).
MSC:  94C10 68Q15
PDF BibTeX XML Cite

Symmetric functions in \(AC^ 0\) can be computed in constant depth with very small size. (English) Zbl 0769.68051

Boolean function complexity, Sel. Pap. Symp., Durham/UK 1990, Lond. Math. Lect. Note Ser. 169, 129-139 (1992).
MSC:  68Q25 68Q15 94C10
PDF BibTeX XML Cite

Functional completeness in the class of semimodular circuits. (English. Russian original) Zbl 0595.94014

Sov. J. Comput. Syst. Sci. 23, No. 6, 70-80 (1985); translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1985, No. 4, 103-114 (1985).
MSC:  94C10
PDF BibTeX XML Cite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Classification