Untitled
Work
Year: 2015
Type: article
Abstract: We present a deterministic algorithm which, given a graph $G$ with $n$ vertices and an integer $1 < m \leq n$, computes in $n^{O(\ln m)}$ time the sum of weights $w(S)$ over all $m$-subsets $S$ of the... more
Source: Theory of Computing
Author Alexander Barvinok
Cites: 23
Cited by: 33
Related to: 10
FWCI: 5.418
Citation percentile (by year/subfield): 90.56
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid