787 search results - page 17 / 158 » Polynomial Constants are Decidable |
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
VMCAI
2005
Springer
14 years 1 months ago
2005
Springer
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
ICDT
2007
ACM
13 years 11 months ago
2007
ACM
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
ECCC
2006
13 years 8 months ago
2006
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...