6111 search results - page 929 / 1223 » Time, Hardware, and Uniformity |
144
click to vote
FPL
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. This paper focuses on a class of problem relating to the multiplication of a single number by several coefficients that, while not constant, are drawn from a finite set ...
164
click to vote
SAT
2004
Springer
16 years 2 days ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
182
click to vote
SAT
2004
Springer
16 years 2 days ago
2004
Springer
Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translating to CNF. The best known example of this feature is probably pro...
156
click to vote
SAT
2004
Springer
16 years 2 days ago
2004
Springer
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
173
click to vote
ARITH
2003
IEEE
16 years 16 hour ago
2003
IEEE
A high-radix composite algorithm for the computation of the powering function (¤¦¥ ) is presented in this paper. The algorithm consists of a sequence of overlapped operations: ...