"On the complexity of the generalized MinRank problem."

Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer (2013)

> Home

Details and statistics

DOI: 10.1016/J.JSC.2013.03.004

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jsc/FaugereDS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/FaugereDS13
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
On the complexity of the generalized MinRank problem. J. Symb. Comput. 55: 30-58 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.