1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2021
The #ETH is False, #k-SAT is in Sub-Exponential Time
Giorgio Camerani
We orchestrate a randomized algorithm for #-SAT which counts the exact number of satisfying assignments in time. The existence of such algorithm signifies that the #E…
cs.CC2020★ 1 cited
The Long, the Short and the Random
Giorgio Camerani
We furnish solid evidence, both theoretical and empirical, towards the existence of a deterministic algorithm for random sparse -SAT instances, which computes the exac…
cs.CC2012
The ODD EVEN DELTA problem is #P-hard
Giorgio Camerani
Let G=(V,E) be a graph. Let k < |V| be an integer. Let O_k be the number of edge induced subgraphs of G having k vertices and an odd number of edges. Let E_k be the number of edge…