1
TÍTULO: Proof complexity of resolution-based QBF calculi
AUTORES: Beyersdorff, O; Chew, L; Janota, M;
PUBLICAÇÃO: 2015, FONTE: 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015 in Leibniz International Proceedings in Informatics, LIPIcs, VOLUME: 30
INDEXADO EM: Scopus