Login / Signup

An Algebraic Approach Towards the Fine-Grained Complexity of Graph Coloring Problems.

Ambroise BarilMiguel CouceiroVictor Lagerkvist
Published in: ISMVL (2022)
Keyphrases
  • fine grained
  • coarse grained
  • access control
  • massively parallel
  • tightly coupled
  • databases
  • computational complexity
  • space complexity
  • probabilistic model
  • worst case
  • satisfiability problem
  • data provenance