23 search results - page 1 / 5 » Satisfiability of Algebraic Circuits over Sets of Natural Nu... |
FSTTCS
2007
Springer
13 years 11 months ago
2007
Springer
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 5 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...
BIRTHDAY
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, sounds and images are coded somewhere in time and space by binary sequences. The m...
NIPS
2004
13 years 6 months ago
2004
This paper presents a general family of algebraic positive definite similarity functions over spaces of matrices with varying column rank. The columns can represent local regions ...