Ambainis, Andris; Gasarch, William; Srinivasan, Aravind; Utis, Andrey Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems. (English) Zbl 1347.68164 ACM Trans. Comput. Theory 7, No. 3, Article No. 10, 10 p. (2015). MSC: 68Q17 68Q10 68Q12 PDFBibTeX XMLCite \textit{A. Ambainis} et al., ACM Trans. Comput. Theory 7, No. 3, Article No. 10, 10 p. (2015; Zbl 1347.68164) Full Text: DOI
Goldreich, Oded; Meir, Or Input-oblivious proof systems and a uniform complexity perspective on P/poly. (English) Zbl 1347.68160 ACM Trans. Comput. Theory 7, No. 4, Article No. 16, 13 p. (2015). MSC: 68Q15 68Q10 PDFBibTeX XMLCite \textit{O. Goldreich} and \textit{O. Meir}, ACM Trans. Comput. Theory 7, No. 4, Article No. 16, 13 p. (2015; Zbl 1347.68160) Full Text: DOI
Watson, Thomas Advice lower bounds for the dense model theorem. (English) Zbl 1347.68174 ACM Trans. Comput. Theory 7, No. 1, Article No. 1, 18 p. (2014). MSC: 68Q17 11K45 PDFBibTeX XMLCite \textit{T. Watson}, ACM Trans. Comput. Theory 7, No. 1, Article No. 1, 18 p. (2014; Zbl 1347.68174) Full Text: DOI Link
Ada, Anil; Chattopadhyay, Arkadev; Cook, Stephen A.; Fontes, Lila; Koucký, Michal; Pitassi, Toniann The hardness of being private. (English) Zbl 1321.94032 ACM Trans. Comput. Theory 6, No. 1, Article No. 1, 24 p. (2014). MSC: 94A60 68Q17 68W25 94A15 94A62 PDFBibTeX XMLCite \textit{A. Ada} et al., ACM Trans. Comput. Theory 6, No. 1, Article No. 1, 24 p. (2014; Zbl 1321.94032) Full Text: DOI