Lehtinen, Karoliina; Parys, Paweł; Schewe, Sven; Wojtczak, Dominik A recursive approach to solving parity games in quasipolynomial time. (English) Zbl 07471697 Log. Methods Comput. Sci. 18, No. 1, Paper No. 8, 18 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{K. Lehtinen} et al., Log. Methods Comput. Sci. 18, No. 1, Paper No. 8, 18 p. (2022; Zbl 07471697) Full Text: arXiv Link
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)
Kanovich, M. I. Quasipolynomial algorithms for recognizing the satisfiability and derivability of propositional formulas. (English. Russian original) Zbl 0629.03013 Sov. Math., Dokl. 34, 273-277 (1987); translation from Dokl. Akad. Nauk SSSR 290, 281-286 (1986). Reviewer: E.Knuth MSC: 03D15 68Q25 PDFBibTeX XMLCite \textit{M. I. Kanovich}, Sov. Math., Dokl. 34, 273--277 (1987; Zbl 0629.03013); translation from Dokl. Akad. Nauk SSSR 290, 281--286 (1986)