154 search results - page 1 / 31 » Equivalence Problems for Circuits over Sets of Natural Numbe... |
CSR
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
CC
2007
Springer
13 years 4 months ago
2007
Springer
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
FSTTCS
2007
Springer
13 years 11 months ago
2007
Springer
ASPDAC
2009
ACM
13 years 9 months ago
2009
ACM
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...