Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with probabilistic networks:
TR13-133 | 23rd September 2013
Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland

A Structured View on Weighted Counting with Relations to Quantum Computation and Applications

Revisions: 2

Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path and the goal is to compute the sum of the weights of all paths (instead of computing the number of accepting paths). We present a structured view on weighted counting by ... more >>>

ISSN 1433-8092 | Imprint