75 citations
- Université Paris CitéFR48 papers
- Centre National de la Recherche ScientifiqueFR25 papers
- Institut national de recherche en sciences et technologies du numériqueFR8 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR8 papers
- Délégation Paris 7FR7 papers
- Sorbonne UniversitéFR4 papers
- École Normale Supérieure de LyonFR3 papers
- Laboratoire d'Informatique de l'École PolytechniqueFR3 papers
- Orange (France)FR3 papers
- CEA Paris-SaclayFR2 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR2 papers
- Computer Algorithms for MedicineAT2 papers
15 papers · 1 filter
Negative bases and automata
Christiane Frougny, Anna Chiara Lai
We study expansions in non-integer negative base -β introduced by Ito and Sadahiro. Using countable automata associated with (-β)-expansions, we characterize the case where the (-β…
Parallel Repetition of Entangled Games
Julia Kempe, Thomas Vidick
We consider one-round games between a classical referee and two players. One of the main questions in this area is the parallel repetition question: Is there a way to decrease the…
Unique perfect phylogeny is NP-hard
Michel Habib, Juraj Stacho
We answer, in the affirmative, the following question proposed by Mike Steel as a $100 challenge: "Is the following problem NP-hard? Given a ternary phylogenetic X-tree T and a col…
Wronskian Solution for AdS/CFT Y-system
Nikolay Gromov, Vladimir Kazakov, Sebastien Leurent +1
Using the discrete Hirota integrability we find the general solution of the full quantum Y-system for the spectrum of anomalous dimensions of operators in the planar AdS5/CFT4 corr…
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes
Marie Ferbus-Zanda, Serge Grigorieff
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rando…
ASMs and Operational Algorithmic Completeness of Lambda Calculus
Marie Ferbus-Zanda, Serge Grigorieff
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any…