Author:
Aisenberg James,Bonet Maria Luisa,Buss Sam,Crăciun Adrian,Istrate Gabriel
Funder
NSF
Skolkovo Institute of Technology
Simons Foundation
IDEI
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference32 articles.
1. J. Aisenberg, M.L. Bonet, S. Buss, Tucker's lemma is PPA complete, 2015, submitted for publication.
2. Quasi-polynomial size Frege proofs of Frankl's theorem on the trace of finite sets;Aisenberg;J. Symb. Log.,2016
3. Short proofs of the Kneser–Lovász coloring principle;Aisenberg,2015
4. Plausibly hard combinatorial tautologies;Avigad,1997
5. Improved witnessing and local improvement principles for second-order bounded arithmetic;Beckmann;ACM Trans. Comput. Log.,2014
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献