983 search results - page 40 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
MOC
2011
13 years 5 months ago
2011
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
TCAD
2008
13 years 10 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
DLOG
2009
13 years 8 months ago
2009
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
IACR
2011
12 years 10 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
DAC
2009
ACM
14 years 11 months ago
2009
ACM
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...