369 citations
- Université Sorbonne Paris NordFR28 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- Laboratoire de Physique Théorique de la Matière CondenséeFR8 papers
- Sorbonne UniversitéFR8 papers
- Université Paris CitéFR7 papers
- Stanford UniversityUS6 papers
- Institute of Nuclear Physics, Polish Academy of SciencesPL5 papers
- The Open UniversityGB5 papers
- Carnegie Mellon UniversityUS4 papers
- Laboratoire de Physique ThéoriqueFR3 papers
- Laboratoire d'Informatique Gaspard-MongeFR3 papers
- Centre de Physique ThéoriqueFR2 papers
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2010
Faster Polynomial Multiplication via Discrete Fourier Transforms
Alexey Pospelov
We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this prob…
cs.CC2010
On the complexity of the multiple stack TSP, kSTSP
Sophie Toulouse, Roberto Wolfler Calvo
The multiple Stack Travelling Salesman Problem, STSP, deals with the collect and the deliverance of n commodities in two distinct cities. The two cities are represented by means of…