Regular prefix relations
- 期刊名称Theory of Computing Systems
- 作者Dana Angluin; Douglas N. Hoover
- 卷第17卷
- 期第1期
- 印刷ISSN1432-4350
- 电子ISSN1433-0490
- 文件大小1632.32KB
- 发表时间1984
- DOI10.1007/bf01744439
- 页码167-191
Effect of the depth of formulas on their complexityO. B. Lupanov · 1970
On the Influence of the Depth of Formulas on Their ComplexityLupanov, O. B. · Journal of Cybernetics · 1971
On the synthesis and complexity of formulae with bounded depth of alternationS. A. Lozhkin, V. A. Konovodov · 2012
On the complexity of bounded-depth circuits and formulas over the basis of fan-in gatesSergeev, Igor' S. · Discrete Mathematics and Applications · 2019
Editor's forewordArnold L. Rosenberg · Theory of Computing Systems · 1994
Universality of iterated networksR. F. Chamberlain; C. M. Fiduccia · Theory of Computing Systems · 1994
Primitives for asynchronous list compressionR. J. Anderson · Theory of Computing Systems · 1994
A lower bound for monotone perceptronsF. Green · Theory of Computing Systems · 1995
Guest editor's noteH. Raymond Strong · Theory of Computing Systems · 1993
The Failure Discovery problemVassos Hadzilacos; Joseph Y. Halpern · Theory of Computing Systems · 1993
Editor's forewordSandeep N. Bhatt · Theory of Computing Systems · 1994
An approach to emulating separable graphsBojana Obrenić · Theory of Computing Systems · 1994