1795 search results - page 92 / 359 » On the Complexity of Circuit Satisfiability |
ITC
1996
IEEE
14 years 29 days ago
1996
IEEE
common use is the distinction into two (abstract) fault models: A new fault modelling scheme for integrated analogue general the "Single Hard Fault Model (SHFM)" and the ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
ASIACRYPT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
COBUILD
1999
Springer
14 years 1 months ago
1999
Springer
A concept of complex objects, being artifacts that have one real physical part and several virtual parts representing certain aspects of the object, is introduced. These parts are ...