35 search results - page 7 / 7 » Polynomial Identity Testing for Depth 3 Circuits |
ASPDAC
2004
ACM
13 years 8 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
ECCC
2010
13 years 5 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
STACS
2010
Springer
13 years 12 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...