Login / Signup

On the parameterized complexity of approximate counting.

J. Andrés Montoya
Published in: RAIRO Theor. Informatics Appl. (2011)
Keyphrases
  • parameterized complexity
  • global constraints
  • fixed parameter tractable
  • search algorithm
  • state space