We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...