FO[<]-uniformity

21st Annual IEEE Conference on Computational Complexity (CCC'06) Pub Date : 2006-07-16 DOI:10.1109/CCC.2006.20

C. Behle, K. Lange

引用次数: 19

Abstract

Uniformity notions more restrictive than the usual FO[<, +, *]-uniformity = FO[<, Bit]-uniformity are introduced. It is shown that the general framework exhibited by Barrington et al. still holds if the fan-in of the gates in the corresponding circuits is considered

查看原文本刊更多论文

FO(<)均匀性

引入了比通常的FO[<， +， *]-uniformity更严格的一致性概念= FO[<， Bit]-uniformity。结果表明，如果考虑相应电路中栅极的扇入，Barrington等人展示的一般框架仍然成立

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

21st Annual IEEE Conference on Computational Complexity (CCC'06)

自引率

0.00%

发文量