One way of coping with agreement of features in French is to perform two parallel computations, one in the free pregroup of syntactic types, the other in that of feature types. Tec...
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
Rodney G. Downey, Sergei S. Goncharov, Asher M. Ka...
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
A new numerical scheme is presented for strictly computing maximum likelihood (ML) of geometric fitting problems. Intensively studied in the past are those methods that first tran...
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...