Author:
Fleming Noah,Pitassi Toniann
Publisher
Springer International Publishing
Reference67 articles.
1. Ajtai, M. (1988). The complexity of the pigeonhole principle. In 29th annual symposium on foundations of computer science, White Plains, New York, USA, 24–26 October 1988 (pp. 346–355). IEEE Computer Society.
2. Alekhnovich, M., Johannsen, J., Pitassi, T., & Urquhart, A. (2007). An exponential separation between regular and general resolution. Theory of Computing, 3(1), 81–102.
3. Alekhnovich, M., & Razborov, A. A. (2011). Satisfiability, branch-width and tseitin tautologies. Computer Complex, 20(4), 649–678.
4. Beame, P., Fleming, N., Impagliazzo, R., Kolokolova, A., Pankratov, D., Pitassi, T., & Robere, R. (2018). Stabbing planes. In 9th innovations in theoretical computer science conference, ITCS 2018, January 11–14 (2018, Cambridge, MA, USA (pp. 10:1–10:20).
5. Beame, P., Impagliazzo, R., Krajícek, J., Pitassi, T., & Pudlák, P. (1994). Lower bound on hilbert’s nullstellensatz and propositional proofs. In 35th annual symposium on foundations of computer science, Santa Fe, New Mexico, USA (20–22 November 1994 (pp. 794–806). IEEE Computer Society.