729 search results - page 27 / 146 » And Or Hierarchies and Round Abstraction |
168
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
155
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
133
click to vote
ENTCS
2006
15 years 6 months ago
2006
nary abstract) Jan Friso Groote 1 MohammadReza Mousavi 2 Michel A. Reniers 3 Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Ein...
135
click to vote
APLAS
2006
ACM
16 years 2 days ago
2006
ACM
Abstract. Class extensions provide a fine-grained mechanism to define incremental modifications to class-based systems when standard subclassing mechanisms are inappropriate. To...
153
click to vote
MCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Obtaining ground truth for hyperspectral data is an expensive task. In addition, a number of factors cause the spectral signatures of the same class to vary with location...