Login / Signup

Almost settling the hardness of noncommutative determinant.

Steve ChienPrahladh HarshaAlistair SinclairSrikanth Srinivasan
Published in: STOC (2011)
Keyphrases
  • phase transition
  • computational complexity
  • learning theory
  • np hardness
  • np hard
  • np complete
  • information theoretic
  • worst case
  • real time
  • machine learning
  • multiscale
  • cooperative