StoqMa(k) equals StoqMa for any polynomial k via a positive value-based de Finetti theorem that approximates nonnegative product values with symmetric extensions.
Granha Jeronimo and P
6 Pith papers cite this work, alongside 11 external citations. Polarity classification is still indexing.
6
Pith papers citing it
11
external citations · external index
representative citing papers
Every graph contains k vertex-disjoint cycles of distinct lengths or has a set of O(k^6 polylog(k)) vertices whose removal leaves at most k-1 cycle lengths.
Vertex-Coloring {0,1}-Edge-Weighting is W[1]-hard parameterized by feedback vertex set size, FPT by vertex cover size (with a restriction for the pre-weighted variant), and admits XP algorithms parameterized by treewidth.
A new data-synthesized instrumental variable estimator achieves finite-sample Lp consistency with sqrt(n) rate for linear-in-parameters models in discrete and continuous time, cutting bias by hundreds of times on Lorenz examples.
citing papers explorer
-
The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
StoqMa(k) equals StoqMa for any polynomial k via a positive value-based de Finetti theorem that approximates nonnegative product values with symmetric extensions.
-
An Erd\H{o}s-P\'osa theorem for cycles and faces of distinct lengths
Every graph contains k vertex-disjoint cycles of distinct lengths or has a set of O(k^6 polylog(k)) vertices whose removal leaves at most k-1 cycle lengths.
-
The Parameterized Complexity of Vertex-Coloring Edge-Weighting
Vertex-Coloring {0,1}-Edge-Weighting is W[1]-hard parameterized by feedback vertex set size, FPT by vertex cover size (with a restriction for the pre-weighted variant), and admits XP algorithms parameterized by treewidth.
-
Instrumental variables system identification with $L^p$ consistency
A new data-synthesized instrumental variable estimator achieves finite-sample Lp consistency with sqrt(n) rate for linear-in-parameters models in discrete and continuous time, cutting bias by hundreds of times on Lorenz examples.
- Improved Approximation Algorithms for n-Pairs Shortest Paths
- Tighter bounds for weighted and unweighted shortest cycle approximation