The following pages link to Yannick Saouter (Q685370):
Displaying 16 items.
- Computability of recurrence equations (Q685372) (← links)
- (Q757081) (redirect page) (← links)
- Synthesis of a new systolic architecture for the algebraic path problem (Q757083) (← links)
- Computability of affine non-conditional recurrent systems (Q1606914) (← links)
- Short effective intervals containing primes (Q1869779) (← links)
- Improved results on the Mertens conjecture (Q2862537) (← links)
- An improved lower bound for the de Bruijn-Newman constant (Q3094293) (← links)
- A sharp region where 𝜋(𝑥)-𝑙𝑖(𝑥) is positive (Q3160747) (← links)
- (Q3840162) (← links)
- Checking the odd Goldbach conjecture up to 10²⁰ (Q4383199) (← links)
- New results for witnesses of Robin’s criterion (Q5029480) (← links)
- Heuristics for cannon's algorithm with an application to lyons sporadic group (Q5175260) (← links)
- A FPGA implementation of Chen's algorithm (Q5175262) (← links)
- NEW RESULTS ON COMPUTABILITY OF RECURRENCE EQUATIONS (Q5248978) (← links)
- A still sharper region where $\pi (x)-{\mathrm {li}}(x)$ is positive (Q5264134) (← links)
- New pancake series for π (Q5860163) (← links)
