A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
From time to time, state-of-the-art contrast enhancement algorithms face undesired drawbacks, like loss of tiny details, enhancement of image noise, occasional overenhancement, an...
The relations among graphical representations, computer functionality, and everyday objects are more complex than terms like “the desktop metaphor” may suggest. While metaphor...