268 search results - page 21 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
59
Voted
CSL
2001
Springer
15 years 2 months ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
CDC
2009
IEEE
15 years 29 days ago
2009
IEEE
— In this article, we investigate a new class of control problems called Ensemble Control, a notion coming from the study of complex spin dynamics in Nuclear Magnetic Resonance (...
72
Voted
PODS
1994
ACM
15 years 1 months ago
1994
ACM
We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion spe...
SIGMOD
2000
ACM
15 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...