8824 search results - page 283 / 1765 » On the Complexity of Real Functions |
131
click to vote
COLING
1990
15 years 7 months ago
1990
Tense and aspect, together with mood and modality, usually form the entangled structure of a complex verb. They are often hard to translate by machines, because of both syntactic ...
152
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
148
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
172
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
183
click to vote
ICALP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...