StoqMA(2) contains NP via Õ(√n)-qubit unentangled stoquastic proofs (nearly perfect completeness) and is contained in EXP, with ETH-optimal parameters matching a refined BKS Sum-of-Squares bound.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 6roles
background 2polarities
background 2representative citing papers
Polynomial kernels exist for Leaf & Internal-Constrained Diverse Spanning Trees (parameter p+q+k+ℓ) and Leaf & Non-terminal-Constrained Diverse Spanning Trees (parameter p+|V_NT|+k+ℓ).
An Õ(Ω(n²)) lower bound for read-once parity branching programs is obtained by reducing to algebraic circuit lower bounds for an explicit function.
Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.
Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.
It gives an explicit infinite ternary word with no parameterized squares of half-length at least 3 and an explicit infinite binary word with no order-preserving squares of half-length at least 3, plus finite extremal lengths.
citing papers explorer
-
The power of unentanglement without destructive interference
StoqMA(2) contains NP via Õ(√n)-qubit unentangled stoquastic proofs (nearly perfect completeness) and is contained in EXP, with ETH-optimal parameters matching a refined BKS Sum-of-Squares bound.
-
Polynomial Kernels for Spanning Tree with Diversity Requirements
Polynomial kernels exist for Leaf & Internal-Constrained Diverse Spanning Trees (parameter p+q+k+ℓ) and Leaf & Non-terminal-Constrained Diverse Spanning Trees (parameter p+|V_NT|+k+ℓ).
-
A Lower Bound for Read-Once Parity Branching Programs
An Õ(Ω(n²)) lower bound for read-once parity branching programs is obtained by reducing to algebraic circuit lower bounds for an explicit function.
-
Fast Obligation Translation and Synthesis
Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.
-
Symbolic Synthesis for LTLf+ Obligations
Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.
-
Relaxation of Square-Freeness
It gives an explicit infinite ternary word with no parameterized squares of half-length at least 3 and an explicit infinite binary word with no order-preserving squares of half-length at least 3, plus finite extremal lengths.