Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. 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) (1979)
2. Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 2nd edn. John Wiley, New York (1993)
3. Kleine Buning, H., Karpinski, M., Flogel, A.: Resolution for quantified Boolean formulas. Information and Computation 117, 12–18 (1995)
4. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley&Sons, New York (1999)
5. Papadimitriou, C.H.: On selecting a satisfying truth assignment. In: IEEE (ed.) Proceedings: 32nd annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1–4, pp. 163–169. IEEE Computer Society Press, Los Alamitos (1991)