154 search results - page 3 / 31 » Equivalence Problems for Circuits over Sets of Natural Numbe... |
CORR
2009
Springer
13 years 4 months ago
2009
Springer
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
ICLP
2003
Springer
13 years 11 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
SIGMOD
2003
ACM
14 years 6 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
DATE
2006
IEEE
14 years 6 days ago
2006
IEEE
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have di...