369 search results - page 26 / 74 » Arithmetic of Generalized Jacobians |
CAV
2009
Springer
14 years 2 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
HASE
2008
IEEE
14 years 2 months ago
2008
IEEE
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
UMC
2000
13 years 11 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
ERSA
2006
13 years 9 months ago
2006
In a coarse-grained reconfigurable architecture, the functions of resources such as Arithmetic Logic Units (ALUs) can be reconfigured. Unlike the programmability of a general purp...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...