Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Aiken, A.: Introduction to set constraint-based program analysis. Science of Computer Programming 35(2), 79–111 (1999)
2. Aspvall, B., Plass, M.F., Tarjan, R.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters 8(3), 121–123 (1979)
3. Lecture Notes in Artificial Intelligence;L.M. Moura de,2004
4. Karger, D.R., Klein, P.N., Tarjan, R.E.: A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM 42(2), 321–328 (1995)
5. Khachiyan, L.G.: A polynomial algorithm for linear programming. Soviet Math. Doklady, vol. 20, pp. 191–194 (1979) (Russian original in Doklady Akademiia Nauk SSSR 244, 1093–1096)