1 citations · 1 across the 5 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2023
Efficient computations in central simple algebras using Amitsur cohomology
Péter Kutas, Mickaël Montessinos
We present an efficient computational representation of central simple algebras using Brauer factor sets. Using this representation and polynomial quantum algorithms for number the…
math.NT2022
Finding nontrivial zeros of quadratic forms over rational function fields of characteristic 2
Tímea Csahók, Péter Kutas, Mickaël Montessinos +1
We propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results…
math.NT2020
Explicit isomorphisms of quaternion algebras over quadratic global fields
Tímea Csahók, Péter Kutas, Mickaël Montessinos +1
Let be a separable quadratic extension of either or . We propose efficient algorithms for finding isomorphisms between quaternion algebras over $L…