3 citations · 4 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis
Michael J. Bremner, Zhengfeng Ji, Xingjian Li +2
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computatio…
cs.CC2012★ 3 cited
A Proof Checking View of Parameterized Complexity
Luke Mathieson
The PCP Theorem is one of the most stunning results in computational complexity theory, a culmination of a series of results regarding proof checking it exposes some deep structure…