1795 search results - page 226 / 359 » On the Complexity of Circuit Satisfiability |
117
Voted
AI
1999
Springer
15 years 15 days ago
1999
Springer
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
TON
1998
15 years 14 days ago
1998
— This paper investigates in detail the blocking and nonblocking behavior of multirate Clos switching networks at the connection/virtual connection level. The results are applica...
104
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper discusses highly general mechanisms for specifying the refinement of a real-time system as a collection of lower level parallel components that preserve the timing and ...
117
click to vote
ISQED
2011
IEEE
14 years 4 months ago
2011
IEEE
Due to the dramatic increase in design complexity, verifying the functional correctness of a circuit is becoming more difficult. Therefore, bugs may escape all verification effo...
99
Voted
IACR
2011
14 years 14 days ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...