99 search results - page 12 / 20 » Uniform Characterizations of Complexity Classes of Functions |
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
ARCS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract: We present a formal framework to talk and reason about dependable systems. The framework is based on three distinct classes of (system specification) properties we call s...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Multi-view learning has become a hot topic during the past few years. In this paper, we first characterize the sample complexity of multi-view active learning. Under the expansion...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...