3 citations
- Université Paris-SudFR4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Budapest University of Technology and EconomicsHU1 paper
- Centre for Quantum TechnologiesSG1 paper
- Hungarian Academy of SciencesHU1 paper
- HUN-REN Institute for Computer Science and ControlHU1 paper
- Instituto Superior de Tecnologias AvançadasPT1 paper
- National University of SingaporeSG1 paper
- Télécom ParisFR1 paper
- Université Paris CitéFR1 paper
5 papers
An Orlik-Solomon type algebra for matroids with a fixed linear class of circuits
Raul Cordovil, David Forge
A family C of circuits of a matroid M is a linear class if, given a modular pair of circuits in C}, any circuit contained in the union of the pair is also in C. The pair (M,C) can…
Enhanced algorithms for Local Search
Yves F. Verhoeven
Let G=(V,E) be a finite graph, and f:V->N be any function. The Local Search problem consists in finding a local minimum of the function f on G, that is a vertex v such that f(v) is…
On the black-box complexity of Sperner's Lemma
Katalin Friedl, Gabor Ivanyos, Miklos Santha +1
We present several results on the complexity of various forms of Sperner's Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ps…
Crossings and alignments of permutations
Sylvie Corteel
We derive the continued fraction form of the generating function of some new -analogs of the Eulerian numbers introduced by Lauren Williams building on work o…
Quantum multiparty communication complexity and circuit lower bounds
Iordanis Kerenidis
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result of our simulation, we show th…