Cited By
View all- Belovs AIvanyos GQiao YSantha MYang S(2017)On the polynomial parity argument complexity of the combinatorial NullstellensatzProceedings of the 32nd Computational Complexity Conference10.5555/3135595.3135625(1-24)Online publication date: 9-Jul-2017
- Beckmann ABuss S(2017)The NP Search Problems of Frege and Extended Frege ProofsACM Transactions on Computational Logic10.1145/306014518:2(1-19)Online publication date: 2-Jun-2017
- Teng S(2016)Scalable Algorithms for Data and Network AnalysisFoundations and Trends® in Theoretical Computer Science10.1561/040000005112:1–2(1-274)Online publication date: 1-May-2016
- Show More Cited By