Cited By
View all- Aaronson SIngram DKretschmer W(2022)The acrobatics of BQPProceedings of the 37th Computational Complexity Conference10.4230/LIPIcs.CCC.2022.20(1-17)Online publication date: 20-Jul-2022
- Håstad JRossman BServedio RTan L(2017)An Average-Case Depth Hierarchy Theorem for Boolean CircuitsJournal of the ACM10.1145/309579964:5(1-27)Online publication date: 29-Aug-2017
- Tamaki SWatanabe O(2017)Local Restrictions from the Furst-Saxe-Sipser PaperTheory of Computing Systems10.1007/s00224-016-9730-060:1(20-32)Online publication date: 1-Jan-2017