1795 search results - page 223 / 359 » On the Complexity of Circuit Satisfiability |
100
click to vote
PKC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
85
Voted
ICCD
2008
IEEE
15 years 9 months ago
2008
IEEE
— Circuit and processor designs will continue to increase in complexity for the foreseeable future. With these increasing sizes comes the use of wide buses to move large amounts ...
105
Voted
ICCD
2003
IEEE
15 years 9 months ago
2003
IEEE
Modern processors rely heavily on broadcast networks to bypass instruction results to dependent instructions in the pipeline. However, as clock rates increase, architectures get w...
97
Voted
ICNP
2009
IEEE
15 years 7 months ago
2009
IEEE
—Routing protocols are implemented in the form of software running on a general-purpose microprocessor. However, conventional software-based router architectures face significan...
89
Voted
ACMSE
2006
ACM
15 years 6 months ago
2006
ACM
Applications involving interactive modeling of deformable objects require highly iterative, floating-point intensive numerical simulations. As the complexity of these models incr...