1399 search results - page 58 / 280 » Multi-party Finite Computations |
ENTCS
2008
13 years 9 months ago
2008
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
ICSE
2009
IEEE-ACM
14 years 10 months ago
2009
IEEE-ACM
ess Preserving Finite State Abstractions Guido de Caso V?ctor Braberman Diego Garbervetsky Sebasti?n Uchitel Departamento de Computaci?n, FCEyN, UBA. Buenos Aires, Argentina Depa...
ANTS
2006
Springer
13 years 12 months ago
2006
Springer
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...
AUTOMATICA
2008
13 years 10 months ago
2008
For a countable-state Markov decision process we introduce an embedding which produces a finite-state Markov decision process. The finite-state embedded process has the same optim...
MOC
2000
13 years 9 months ago
2000
The lifting of results from factor groups to the full group is a standard technique for solvable groups. This paper shows how to utilize this approach in the case of non-solvable n...