Login / Signup

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzazewski Conjecture.

Ambroise BarilMiguel CouceiroVictor Lagerkvist
Published in: CoRR (2024)
Keyphrases
  • fine grained
  • coarse grained
  • tightly coupled
  • access control
  • decision problems
  • massively parallel
  • computational complexity
  • worst case
  • polynomial time complexity