Fine-grained Complexity Meets IP = PSPACE
From MaRDI portal
Publication:5236182
DOI10.1137/1.9781611975482.1zbMath1431.68045arXiv1805.02351OpenAlexW2801961161MaRDI QIDQ5236182
Kaifeng Lyu, Aviad Rubinstein, Guy N. Rothblum, Lijie Chen
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.02351
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
This page was built for publication: Fine-grained Complexity Meets IP = PSPACE
