2 search results - page 1 / 1 » Verifying Imprecisely Working Arithmetic Circuits |
DATE
1999
IEEE
13 years 9 months ago
1999
IEEE
If real number calculations are implemented as circuits, only a limited preciseness can be obtained. Hence, formal verification can not be used to prove the equivalence between th...
ECCC
2011
12 years 11 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 ...