Funder
Ministerio de Economía y Competitividad
National Science Foundation
Simons Foundation
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference26 articles.
1. Short proofs of the Kneser-Lovász coloring principle;Aisenberg;Inf. Comput.,2018
2. The relative complexity of NP search problems;Beame;J. Comput. Syst. Sci.,1998
3. Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies;Buss;Theor. Comput. Sci.,2006
4. On the complexity of 2D discrete fixed point problem (extended abstract);Chen,2006
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献