The following pages link to Natacha Portier (Q208825):
Displaying 26 items.
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Universal resolution for NP-complete problems (Q1129008) (← links)
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide (Q1611897) (← links)
- A rank theorem for Vandermonde matrices (Q1826719) (← links)
- On the complexity of the multivariate resultant (Q1939330) (← links)
- Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
- On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem (Q2256583) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- The quantum query complexity of the abelian hidden subgroup problem (Q2373740) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- The problem of large powers and that of large roots (Q2710600) (← links)
- The minimal realization problem in the max-plus semiring and Pisot's problem are \(NP\)-hard (Q2778041) (← links)
- The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent (Q2911618) (← links)
- Factoring bivariate lacunary polynomials without heights (Q2963227) (← links)
- (Q3105511) (← links)
- Symmetric Determinantal Representation of Weakly-Skew Circuits (Q3113718) (← links)
- Physique quantique, information et calcul (Q3388108) (← links)
- Adversary Lower Bounds for Nonadaptive Quantum Algorithms (Q3511461) (← links)
- The Multivariate Resultant Is NP-hard in Any Characteristic (Q3586107) (← links)
- Stabilité polynômiale des corps différentiels (Q4262586) (← links)
- Decidable and Undecidable Problems about Quantum Automata (Q5317206) (← links)
- Automata, Languages and Programming (Q5716753) (← links)
- Characterizing Valiant’s Algebraic Complexity Classes (Q5756717) (← links)
- Back-and-forth systems for generic curves and a decision algorithm for the limit theory (Q5946087) (← links)
