Cai, Pu; Cai, Jin-Yi; Naik, Ashish V. Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns. (English) Zbl 0896.90136 J. Comb. Optim. 1, No. 4, 367-376 (1998). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{P. Cai} et al., J. Comb. Optim. 1, No. 4, 367--376 (1998; Zbl 0896.90136) Full Text: DOI
Maciel, Alexis; Pitassi, Toniann Towards lower bounds for bounded-depth Frege proofs with modular connectives. (English) Zbl 0891.03027 Beame, Paul W. (ed.) et al., Proof complexity and feasible arithmetics. Papers from the DIMACS workshop, Rutgers, NJ, USA, April 21–24, 1996. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 39, 195-227 (1998). MSC: 03F20 68Q15 03B35 PDFBibTeX XMLCite \textit{A. Maciel} and \textit{T. Pitassi}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 39, 195--227 (1998; Zbl 0891.03027)