Login / Signup

Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis.

Armin Weiß
Published in: ICALP (2020)
Keyphrases
  • np complete
  • np hard
  • computational complexity
  • special case
  • learning theory
  • numerical solution
  • group members
  • database
  • real time
  • data mining
  • finite number
  • unit length