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...
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
This paper presents two new algorithms, Redundant Vector Elimination(RVE) and Essential Fault Reduction (EFR), for generating compact test sets for combinational circuits under th...
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...