The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems

From MaRDI portal
Publication:2235760

DOI10.1016/j.tcs.2021.09.006OpenAlexW3196775331WikidataQ115566727 ScholiaQ115566727MaRDI QIDQ2235760

Yanyan Li

Publication date: 21 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.006




Related Items (1)



Cites Work


This page was built for publication: The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems