文章基本信息
- 标题：Uniform Inclusions in Nondeterministic Logspace
- 本地全文：下载
- 作者：Eric Allender, Shiyu Zhou
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：1998
- 卷号：1998
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：We show that the complexity class LogFew is contained in NL SPL. Previously, this was known only to hold in the nonuniform setting.
- 关键词：arithmetic circuits, derandomization, determinant, gapl, LogFew, NL, nondeterministic logspace, SPL
