10 search results - page 1 / 2 » Arithmetic Circuits: A survey of recent results and open que... |
FTTCS
2010
13 years 2 months ago
2010
ARITH
2009
IEEE
14 years 6 days ago
2009
IEEE
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open and largely unsolved problem, espec...
COCO
2006
Springer
13 years 7 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...
ACL
2010
13 years 3 months ago
2010
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...