Abstract
In this paper we shall characterize the computational complexity of two decision problems: the inequality problem and the uniform word problem for semilinear sets. It will be proved that the first problem is log-complete in the second class (Σp2) of the polynomial-time hierarchy and the second problem is log-complete in NP. Moreover we shall show that these problems restricted to the 1-dimensional case have the ‘same’ computational complexity as the general case.
Cite
CITATION STYLE
Huynh, T. D. (1980). The complexity of semilinear sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 85 LNCS, pp. 324–337). Springer Verlag. https://doi.org/10.1007/3-540-10003-2_81
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
