Skip to main content

computational complexity

Ausgabe 2/2022

Inhalt (11 Artikel)

Quadratic Lower Bounds for Algebraic Branching Programs and Formulas

Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk

Open Access

Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond

Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar

Open Access

Zeros and approximations of Holant polynomials on the complex plane

Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski

A Lower Bound on Determinantal Complexity

Mrinal Kumar, Ben Lee Volk

Quantum generalizations of the polynomial hierarchy with applications to QMA(2)

Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka

Improved Hitting Set for Orbit of ROABPs

Vishwas Bhargava, Sumanta Ghosh