Count on CFI graphs for #P-hardness

Søgeresultater

• CountBeyond: Beyond Exact Counting: Approximation and Symmetry

  Curticapean, R.-C. (PI)

  Villum Fonden

  01/06/2023 → 30/09/2023

  Projekter: Projekt › Forskning

  • Polynomial Time 100%
  • Homomorphism 83%
  • Algorithm Complexity 78%
  • Graph Theory 62%
  • Theoretical Computer Science 62%

• CountHom: Counting (with) homomorphisms

  Curticapean, R.-C. (PI)

  European Commission

  01/04/2023 → 31/03/2028

  Projekter: Projekt › Forskning

  • Homomorphism 100%
  • Counting Complexity 66%
  • Fundamental Question 66%
  • Counting Problems 44%
  • Computational Complexity 40%