P-Completeness of Testing Solutions of Parametric Interval Linear Systems
- 7 Downloads
We deal with a system of parametric interval linear equations and also with its particular sub-classes defined by symmetry of the constraint matrix. We show that the problem of checking whether a given vector is a solution is a P-complete problem, meaning that there unlikely exists a polynomial closed form arithmetic formula describing the solution set. This is true not only for the general parametric system, but also for the symmetric case with general linear dependencies in the right-hand side. However, we leave as an open problem whether P-completeness concerns also the simplest version of the symmetric solution set with no dependencies in the right-hand side interval vector.
The author was supported by the Czech Science Foundation Grant P403-18-04735S.
- 5.Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, New York (1995)Google Scholar
- 8.Lueker, G.S., Megiddo, N., Ramachandran, V.: Linear programming with two variables per inequality in poly-log time. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC ’86, pp. 196–205. ACM, New York (1986)Google Scholar
- 10.Mayer, G.: A survey on properties and algorithms for the symmetric solution set. Technical Report 12/2, Universität Rostock, Institut für Mathematik (2012). http://ftp.math.uni-rostock.de/pub/preprint/2012/pre12_02.pdf
- 15.Schrijver, A.: Theory of Linear and Integer Programming. Repr. Wiley, Chichester (1998)Google Scholar