Given a set of persistence diagrams P_1,..., P_m, for the data
reduction...
The Max-Cut problem is known to be NP-hard on general graphs, while it c...
We first show that under SETH and its variant, strong and weak classical...
It is known that several sub-universal quantum computing models cannot b...
The one-clean-qubit model (or the DQC1 model) is a restricted model of
q...