10054 search results - page 160 / 2011 » On the Complexity of Function Learning |
107
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
89
Voted
ENTCS
2006
15 years 20 days ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
140
click to vote
AEI
1999
15 years 10 days ago
1999
Design synthesis represents a highly complex task in the field of industrial design. The main difficulty in automating it is the definition of the design and performance spaces, i...
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
IJAR
2007
15 years 17 days ago
2007
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...