Zobrazeno 1 - 1
of 1
pro vyhledávání: '"ground reducbility"'
Autor:
Hubert Comon, Florent Jacquemard
Publikováno v:
LICS
Information and Computation
Information and Computation, 2003, 187 (1), pp.123-153
[Research Report] RR-3800, INRIA. 1999, pp.26
Information and Computation, Elsevier, 2003, 187 (1), pp.123-153
Information and Computation
Information and Computation, 2003, 187 (1), pp.123-153
[Research Report] RR-3800, INRIA. 1999, pp.26
Information and Computation, Elsevier, 2003, 187 (1), pp.123-153
We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the computations of an alternating Turing machine whose space is polynomially bounded. It is more difficult to show that ground reducibi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eace98698f1c9370a9548fe8de20809a
https://doi.org/10.1016/s0890-5401(03)00134-2
https://doi.org/10.1016/s0890-5401(03)00134-2
