Sciweavers

855 search results - page 1 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
142
Voted
MST
2011
244views Hardware» more  MST 2011»
14 years 4 months ago
Complexity of Equations over Sets of Natural Numbers
Artur Jez, Alexander Okhotin
64
Voted
STACS
2009
Springer
15 years 5 months ago
Equations over Sets of Natural Numbers with Addition Only
Artur Jez, Alexander Okhotin
81
Voted
CC
2007
Springer
158views System Software» more  CC 2007»
14 years 10 months ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
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...
Pierre McKenzie, Klaus W. Wagner
66
Voted
CSR
2007
Springer
15 years 4 months ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...
66
Voted
FSTTCS
2007
Springer
15 years 4 months ago
Satisfiability of Algebraic Circuits over Sets of Natural Numbers
Christian Glaßer, Christian Reitwießne...