In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decompo...
David Bremner, Mathieu Dutour Sikiric, Achill Sch&...
: This paper deals with a special class of three-degree-of-freedom parallel manipulators. First, the singular configurations of the two Jacobian matrices are studied. The isotropic...
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints,...
Mathieu Giraud, Philippe Veber, Dominique Lavenier