Login / Signup

Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication.

Matthew AndersonVu Le
Published in: COCOON (2) (2023)
Keyphrases
  • matrix multiplication
  • special case
  • np complete
  • constraint satisfaction
  • computational complexity
  • np hard
  • sufficient conditions
  • image sequences
  • pairwise
  • higher order
  • message passing