16430 search results - page 577 / 3286 » On Computable Tree Functions |
182
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 ...
187
click to vote
CORR
2010
Springer
15 years 7 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...
138
click to vote
MOC
2002
15 years 6 months ago
2002
Finite element derivative superconvergent points for harmonic functions under local rectangular mesh are investigated. All superconvergent points for the finite element space of an...
199
click to vote
DMTCS
2010
15 years 4 months ago
2010
Abstract. For 3 different versions of q-tangent resp. q-cotangent functions, we compute the continued fraction expansion explicitly, by guessing the relative quantities and proving...
177
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...