CIRCUITS CONSTRUCTED WITH MODq GATES CANNOT COMPUTE "AND" IN SUBLINEAR SIZE
暂无分享，去创建一个
Algebraic techniques are used to prove that any circuit constructed with MODq gates that computes the AND function must use f~(n) gates at the first level. The best bound previously known to be valid for arbitrary q was Ft(log n). Subject classifications. 68Q05, 68Q25, 68Q40.
[1] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..
[2] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[3] Roman Smolensky. On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[4] Howard Straubing,et al. Non-Uniform Automata Over Groups , 1990, Inf. Comput..