RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Dokl. Akad. Nauk: Year: Volume: Issue: Page: Find

 Dokl. Akad. Nauk SSSR, 1980, Volume 250, Number 4, Pages 782–787 (Mi dan43322)

MATHEMATICS

The complexity of the realization of Boolean functions by schemes and formulas in bases consisting of continuous functions

S. B. Gashkov

Lomonosov Moscow State University

Full text: PDF file (665 kB)

Bibliographic databases:
UDC: 519.95
Presented: À. Í. Òèõîíîâ

Citation: S. B. Gashkov, “The complexity of the realization of Boolean functions by schemes and formulas in bases consisting of continuous functions”, Dokl. Akad. Nauk SSSR, 250:4 (1980), 782–787

Citation in format AMSBIB
\Bibitem{Gas80} \by S.~B.~Gashkov \paper The complexity of the realization of Boolean functions by schemes and formulas in bases consisting of continuous functions \jour Dokl. Akad. Nauk SSSR \yr 1980 \vol 250 \issue 4 \pages 782--787 \mathnet{http://mi.mathnet.ru/dan43322} \mathscinet{http://www.ams.org/mathscinet-getitem?mr=0560374} \zmath{https://zbmath.org/?q=an:0442.94017} 

• http://mi.mathnet.ru/eng/dan43322
• http://mi.mathnet.ru/eng/dan/v250/i4/p782

 SHARE:

Citing articles on Google Scholar: Russian citations, English citations
Related articles on Google Scholar: Russian articles, English articles

This publication is cited in the following articles:
1. S. B. Gashkov, I. S. Sergeev, “A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials”, Sb. Math., 203:10 (2012), 1411–1447