Abstract
In this paper, we establish the computational complexities of selected forms of refutations of linear programs. Linear programming is in the complexity class P and hence, it must have short affirmative and disqualifying certificates. One of the more celebrated lemmata in linear programming is Farkas’ lemma, which establishes that both “yes" and “no" certificates can be thought of as solutions to complementary linear programs. Since then, it has been established that if a linear program is feasible, then it must have a solution which is bounded by a polynomial function of the input size. The latter observation, coupled with Farkas’ lemma, immediately establishes that linear programming is in NP \(\cap \) coNP. Our goal is to study the computational complexities of determining various constrained refutations for a given linear programming problem. This paper focuses on three distinct refutation forms, viz., read-once, tree-like and dag-like. We establish that checking if a linear program has a read-once refutation is NP-complete, even when it is defined by Binary Two Variable Per Inequality (BTVPI) constraints. Furthermore, the problems of finding the shortest tree-like and dag-like refutations are NPO-complete and NPO PB-complete respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Armando, A., Castellini, C., Mantovani, J.: Software model checking using linear constraints. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 209–223. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30482-1_22
Beame, P., Pitassi, T.: Simplified and improved resolution lower bounds. In: 37th Annual Symposium on Foundations of Computer Science, pp. 274–282. IEEE, Burlington (1996)
Berman, P., Schnitger, G.: On the complexity of approximating the independent set problem. Inf. Comput. 96(1), 77–94 (1992)
Berstel, B., Leconte, M.: Using constraints to verify properties of rule programs. In: Proceedings of the 2010 International Conference on Software Testing, Verification, and Validation Workshops, pp. 349–354 (2008)
Ceberio, M., Acosta, C., Servin, C.: A constraint-based approach to verification of programs with floating-point numbers. In: Proceedings of the 2008 International Conference of Software Engineering Research and Practice, pp. 225–230 (2008)
Collavizza, H., Reuher, M.: Exploration of the capabilities of constraint programming for software verification. In: Proceedings of the 2006 International Conference on Tools and Algorithms for the Construction and Analysis of Systems (2006)
Collavizza, H., Rueher, M., Van Hentenryck, P.: CPBPV: a constraint-programming framework for bounded program verification. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 327–341. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85958-1_22
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
Farkas, G.: Über die Theorie der Einfachen Ungleichungen. Journal für die Reine und Angewandte Mathematik 124(124), 1–27 (1902)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman Company, San Francisco (1979)
Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. In: Proceedings of the 2008 ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York (2008)
Iwama, K., Miyano, E.: Intractability of read-once resolution. In: Proceedings of the 10th Annual Conference on Structure in Complexity Theory (SCTC 1995), pp. 29–36. IEEE Computer Society Press, Los Alamitos (1995)
Kann, V.: Polynomially bounded minimization problems that are hard to approximate. Nordic J. Comput. 1(3), 317–331 (1994)
Kleine Büning, H., Wojciechowski, P., Chandrasekaran, R., Subramani, K.: Restricted cutting plane proofs in horn constraint systems. In: Herzig, A., Popescu, A. (eds.) FroCoS 2019. LNCS (LNAI), vol. 11715, pp. 149–164. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-29007-8_9
Kleine Büning, H., Wojciechowski, P.J., Subramani, K.: Finding read-once resolution refutations in systems of 2CNF clauses. Theor. Comput. Sci. 729, 42–56 (2018)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley & Sons, New York (1999)
Orponen, P., Mannila, H.: On approximation preserving reductions: complete problems and robust measures. Department of Computer Science, University of Helsinki, Technical report (1987)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1987)
Subramani, K.: Optimal length resolution refutations of difference constraint systems. J. Autom. Reason. (JAR) 43(2), 121–137 (2009)
Subramani, K., Wojciechowki, P.: A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints. Algorithmica 81(7), 2765–2794 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Ethics declarations
Disclosure of Interests
This research was supported in part by the Defense Advanced Research Projects Agency through grant HR001123S0001-FP-004.
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Subramani, K., Wojciechowski, P. (2024). On the Computational Complexities of Finding Selected Refutations of Linear Programs. In: Barneva, R.P., Brimkov, V.E., Gentile, C., Pacchiano, A. (eds) Artificial Intelligence and Image Analysis. IWCIA ISAIM 2024 2024. Lecture Notes in Computer Science, vol 14494. Springer, Cham. https://doi.org/10.1007/978-3-031-63735-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-031-63735-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-63734-6
Online ISBN: 978-3-031-63735-3
eBook Packages: Computer ScienceComputer Science (R0)