356 search results - page 2 / 72 » Parallelizing time with polynomial circuits |
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
SPAA
2003
ACM
14 years 8 days ago
2003
ACM
DAGSTUHL
2007
13 years 8 months ago
2007
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
LACL
2005
Springer
14 years 16 days ago
2005
Springer
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...