output
20032009
most citedTesting bibliometric indicators by their prediction of scientists promotions

93 citations

researchers with a paper here
collaborating institutions
Showing 2003Show all

3 papers · 1 filter

cs.MS2003★ 1 cited

Finding the "truncated" polynomial that is closest to a function

Nicolas Brisebarre, Jean-Michel Muller

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial…

quant-ph2003★ 1 cited

Decidable and undecidable problems about quantum automata

Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran +1

We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable dependi…

math.CO2003

Domino tilings and related models: space of configurations of domains with holes

Sebastien Desreux, Martin Matamala, Ivan Rapaport +1

We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretat…