Fine-grained complexity meets IP = PSPACE
In this paper we study the fine-grained complexity of finding exact and approximate solutions to problems in P. Our main contribution is showing reductions from an exact to an approximate solution for a host of such problems. As one (notable) example, we show that the Closest-LCS-Pair problem (Given...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2021-01-26T19:05:03Z.
|
| Subjects: | |
| Online Access: | Get fulltext |