Author:
Miltersen Peter Bro,Vinodchandran N. V.,Watanabe Osamu
Publisher
Springer Berlin Heidelberg
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Symmetric Exponential Time Requires Near-Maximum Circuit Size;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Polynomial-Time Pseudodeterministic Construction of Primes;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. END-EXTENSIONS OF MODELS OF WEAK ARITHMETIC FROM COMPLEXITY-THEORETIC CONTAINMENTS;The Journal of Symbolic Logic;2016-07-19
4. Proving Circuit Lower Bounds in High Uniform Classes;Interdisciplinary Information Sciences;2014
5. On Learning, Lower Bounds and (un)Keeping Promises;Automata, Languages, and Programming;2014