Login / Signup

A stronger connection between the asymptotic rank conjecture and the set cover conjecture.

Kevin Pratt
Published in: CoRR (2023)
Keyphrases
  • set cover
  • greedy algorithm
  • network flow
  • greedy heuristic
  • np hard
  • linear program
  • greedy heuristics
  • neural network
  • decision trees
  • face recognition