693 search results - page 32 / 139 » Categorical Properties of The Complex Numbers |
124
click to vote
FUN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
EUROCOLT
1999
Springer
15 years 4 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
126
click to vote
STOC
2000
ACM
15 years 3 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
111
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
106
click to vote
KDD
2006
ACM
16 years 6 days ago
2006
ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...