research
∙
10/03/2019
On Computing a Center Persistence Diagram
Given a set of persistence diagrams P_1,..., P_m, for the data reduction...
share
research
∙
04/10/2019
An FPT Algorithm for Max-Cut Parameterized by Crossing Number
The Max-Cut problem is known to be NP-hard on general graphs, while it c...
research
∙
02/22/2019
Depth-scaling fine-grained quantum supremacy based on SETH and qubit-scaling fine-grained quantum supremacy based on Orthogonal Vectors and 3-SUM
We first show that under SETH and its variant, strong and weak classical...
research
∙
01/07/2019
Fine-grained quantum computational supremacy
It is known that several sub-universal quantum computing models cannot b...
research
∙
01/07/2019
