Robuta

https://arxiv.org/abs/1910.01293 [1910.01293] A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT Abstract page for arXiv paper 1910.01293: A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT exponential time https://deepai.org/publication/faster-exponential-time-algorithms-for-approximately-counting-independent-sets Faster Exponential-time Algorithms for Approximately Counting Independent Sets | DeepAI May 11, 2020 - 05/11/20 - Counting the independent sets of a graph is a classical #P-complete problem, even in the bipartite case. We give an exponential-ti... exponential timeindependent setsfasteralgorithmsapproximately https://arxiv.org/abs/1907.00529 [1907.00529] Exponential-time quantum algorithms for graph coloring problems Abstract page for arXiv paper 1907.00529: Exponential-time quantum algorithms for graph coloring problems algorithms for graph coloringexponential time190700529quantum