373 search results - page 37 / 75 » Learning Arithmetic Circuits |
ECCC
2011
13 years 2 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
ISCAS
2007
IEEE
14 years 1 months ago
2007
IEEE
—This paper presents work on ultra-low-power circuits for brain–machine interfaces with applications for paralysis prosthetics, stroke, Parkinson’s disease, epilepsy, prosthe...
DATE
1999
IEEE
13 years 12 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
ICALP
2010
Springer
14 years 12 days 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...
IJCAI
2003
13 years 9 months ago
2003
Minesweeper is a one-person game which looks deceptively easy to play, but where average human performance is far from optimal. Playing the game requires logical, arithmetic and p...