We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...
The location-sensing technology is a core technology of location-based services and applications. In this paper, we present a location-sensing method, called as cell-based positio...
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...