|
Zapiski Nauchnykh Seminarov LOMI, 1977, Volume 68, Pages 19–25
(Mi znsl1997)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
A lower bound for the computational complexity of a set of disjunctives in a monotone basis
D. Yu. Grigor'ev
Abstract:
A set of disjunctions of some variables is constructed and a nonlinear lower bound is proved for the circuit complexity of this set in systems of functional elements (s.f.e.) in a fixed monotone basis. The proposed method for proving the lower bound of circuit complexity in the s.f.e. differs from previously known methods (in a monotone basis).
Citation:
D. Yu. Grigor'ev, “A lower bound for the computational complexity of a set of disjunctives in a monotone basis”, Theoretical application of methods of mathematical logic. Part II, Zap. Nauchn. Sem. LOMI, 68, "Nauka", Leningrad. Otdel., Leningrad, 1977, 19–25; J. Soviet Math., 15:1 (1981), 11–14
Linking options:
https://www.mathnet.ru/eng/znsl1997 https://www.mathnet.ru/eng/znsl/v68/p19
|
Statistics & downloads: |
Abstract page: | 313 | Full-text PDF : | 56 |
|