1379 search results - page 238 / 276 » The Complexity of the Annihilating Polynomial |
COMGEO
2010
ACM
14 years 10 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...
100
click to vote
EAAI
2008
14 years 10 months ago
2008
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...
EOR
2008
14 years 10 months ago
2008
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...