5084 search results - page 60 / 1017 » Proving Possibility Properties |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
ALT
2004
Springer
14 years 7 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
DSN
2009
IEEE
14 years 4 months ago
2009
IEEE
Remote attestation of system integrity is an essential part of trusted computing. However, current remote attestation techniques only provide integrity proofs of static properties...
KBSE
2005
IEEE
14 years 3 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...