Sciweavers

28888 search results - page 134 / 5778
» Computability and complexity in analysis
Sort
View
ACL
1990
13 years 9 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter
BSL
2008
97views more  BSL 2008»
13 years 8 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
CONCURRENCY
2010
85views more  CONCURRENCY 2010»
13 years 8 months ago
Complex version of high performance computing LINPACK benchmark (HPL)
R. F. Barrett, T. H. F. Chan, Eduardo F. D'Azevedo...