Author:
Müller Moritz,Szeider Stefan
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference47 articles.
1. Space complexity in propositional calculus;Alekhnovich;SIAM J. Comput.,2002
2. A combinatorial characterization of resolution width;Atserias;J. Comput. Syst. Sci.,2008
3. Partially definable forcing and bounded arithmetic;Atserias;Arch. Math. Log.,2015
4. Digraphs;Bang-Jensen,2009
5. Time space tradeoffs in resolution: superpolynomial lower bounds for superlinear space;Beame,2012
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Automating Resolution is NP-Hard;Journal of the ACM;2020-10-16
2. Automating Resolution is NP-Hard;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11