output
20162025
most citedA Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces

14 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2016Show all

5 papers · 1 filter

quant-ph2016

Determinism and Computational Power of Real Measurement-based Quantum Computation

Simon Perdrix, Luc Sanselme

Measurement-based quantum computing (MBQC) is a universal model for quantum computation. The combinatorial characterisation of determinism in this model, powered by measurements, a…

math.NT2016★ 2 cited

Twelve new primitive binary trinomials

Richard P. Brent, Paul Zimmermann

We exhibit twelve new primitive trinomials over GF(2) of record degrees , , and . In addition we report the first Mersenne exponent not ruled out by S…

cs.SC2016★ 1 cited

Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems

Jean-Charles Faugere, Pierre-Jean Spaenlehauer, Jules Svartz

B{é}zout 's theorem states that dense generic systems of n multivariate quadratic equations in n variables have 2 n solutions over algebraically closed fields. When only a small su…

cs.CR2016★ 2 cited

A modified block Lanczos algorithm with fewer vectors

Emmanuel Thomé

The block Lanczos algorithm proposed by Peter Montgomery is an efficient means to tackle the sparse linear algebra problem which arises in the context of the number field sieve fac…

cs.SC2016★ 1 cited

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix

Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé +1

Computational problem certificates are additional data structures for each output, which can be used by a-possibly randomized-verification algorithm that proves the correctness of…