The following pages link to Sébastien Tavenas (Q480685):
Displaying 24 items.
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- \textsf{VNP} = \textsf{VP} in the multilinear world (Q894473) (← links)
- On the Markov numbers: fixed numerator, denominator, and sum conjectures (Q2048376) (← 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)
- Building efficient and compact data structures for simplicial complexes (Q2408925) (← links)
- Improved bounds for reduction to depth 4 and depth 3 (Q2514141) (← links)
- Detecting wheels (Q2815233) (← links)
- Improved Bounds for Reduction to Depth 4 and Depth 3 (Q2849964) (← links)
- Log-Concavity and Lower Bounds for Arithmetic Circuits (Q2946406) (← links)
- (Q4598169) (← links)
- (Q4608575) (← links)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
- On the Sensitivity Conjecture for Disjunctive Normal Forms (Q4636562) (← links)
- Reconstruction of Full Rank Algebraic Branching Programs (Q5111151) (← links)
- Reconstruction of Full Rank Algebraic Branching Programs (Q5205803) (← links)
- On the size of homogeneous and of depth four formulas with low individual degree (Q5361866) (← links)
- Building Efficient and Compact Data Structures for Simplicial Complexes (Q5368718) (← links)
- (Q5875648) (← links)
- Rational and lacunary algebraic curves (Q6516917) (← links)
- On the partial derivative method applied to lopsided set-multilinear polynomials (Q6568375) (← links)
- Towards optimal depth-reductions for algebraic formulas (Q6640365) (← links)
- On the complexity of Client-Waiter and Waiter-Client games (Q6735798) (← links)
- Improved fewnomial upper bounds from Wronskians and dessins d'enfant (Q6742793) (← links)
