13784 search results - page 321 / 2757 » On Computing Functions with Uncertainty |
160
Voted
LICS
2003
IEEE
15 years 12 months ago
2003
IEEE
We establish the eventual periodicity of the spectrum of any monadic second-order formula where (i) all relation symbols, except equality, are unary, and (ii) there is only one fu...
213
click to vote
DFG
1992
Springer
15 years 10 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
148
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
The integration of functional and logic programming is a well developed field of research. We discuss that the integration could be improved significantly in two separate aspects: ...
167
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
173
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...