983 search results - page 50 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
CRYPTO
2012
Springer
12 years 25 days ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
DATE
1999
IEEE
14 years 2 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
VLSID
2003
IEEE
14 years 10 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
ICCAD
1999
IEEE
14 years 2 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
SIGMOD
2000
ACM
14 years 2 months ago
2000
ACM
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...