Sign in

Computing Generalized Convolutions Faster Than Brute Force.

Baris Can EsmerAriel KulikDániel MarxPhilipp SchepperKarol Wegrzycki
Published in: Algorithmica (2024)
Keyphrases
  • brute force
  • computationally expensive
  • exhaustive search
  • search quality
  • locality sensitive hashing
  • candidate set
  • computer chess
  • real time
  • neural network
  • reinforcement learning
  • lower bound
  • simulated annealing