AI Chat AI Image Generator AI Video Text to Speech

The complexity of MinRank

05/06/2019

∙

by Alessio Caminata, et al.

∙

∙

In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case. Our main theorem recovers and extends previous results by Faugère, Safey El Din, Spaenlehauer (arXiv:1112.4411).

Alessio Caminata
3 publications
Elisa Gorla
15 publications

page 1

page 2

page 3

page 4

research

∙ 11/22/2017

A note on recent criticisms to Birnbaum's theorem

In this note, we provide critical commentary on two articles that cast d...

0 Víctor Peña, et al. ∙

research

∙ 02/28/2023

A short proof for the parameter continuation theorem

The Parameter Continuation Theorem is the theoretical foundation for pol...

0 Viktoriia Borovik, et al. ∙

research

∙ 03/20/2022

Note on a Fibonacci Parity Sequence

Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in...

0 Jeffrey Shallit, et al. ∙

research

∙ 08/31/2021

Formalizing the Gromov-Hausdorff space

The Gromov-Hausdorff space is usually defined in textbooks as "the space...

0 Sébastien Gouëzel, et al. ∙

research

∙ 09/09/2019

The Cook-Reckhow definition

The Cook-Reckhow 1979 paper defined the area of research we now call Pro...

0 Jan Krajicek, et al. ∙

research

∙ 10/04/2017

Note on "The Complexity of Counting Surjective Homomorphisms and Compactions"

Focke, Goldberg, and Živný (arXiv 2017) prove a complexity dichotomy for...

0 Holger Dell, et al. ∙

research

∙ 12/13/2017

Recognizing Linked Domain in Polynomial Time

The celebrated Gibbard-Satterthwaite Theorem states that any surjective ...

0 Yongjie Yang, et al. ∙