Codenotti, Bruno; Shparlinski, Igor E.; Winterhof, Arne On the hardness of approximating the permanent of structured matrices. (English) Zbl 1048.15006 Comput. Complexity 11, No. 3-4, 158-170 (2002). MSC: 15A15 15B57 11T23 68Q17 11P05 PDFBibTeX XMLCite \textit{B. Codenotti} et al., Comput. Complexity 11, No. 3--4, 158--170 (2002; Zbl 1048.15006) Full Text: DOI
Fortnow, Lance; Rogers, John D. Separability and one-way functions. (English) Zbl 1137.68407 Comput. Complexity 11, No. 3-4, 137-157 (2002). MSC: 68Q15 PDFBibTeX XMLCite \textit{L. Fortnow} and \textit{J. D. Rogers}, Comput. Complexity 11, No. 3--4, 137--157 (2002; Zbl 1137.68407) Full Text: DOI
Ben-Sasson, Eli Hard examples for the bounded depth Frege proof system. (English) Zbl 1043.03043 Comput. Complexity 11, No. 3-4, 109-136 (2002). MSC: 03F20 68Q17 03B35 PDFBibTeX XMLCite \textit{E. Ben-Sasson}, Comput. Complexity 11, No. 3--4, 109--136 (2002; Zbl 1043.03043) Full Text: DOI
Buresh-Oppenheim, Joshua; Clegg, Matthew; Impagliazzo, Russell; Pitassi, Toniann Homogenization and the polynomial calculus. (English) Zbl 1103.68564 Comput. Complexity 11, No. 3-4, 91-108 (2002). MSC: 68Q17 03F20 13P10 68Q30 PDFBibTeX XMLCite \textit{J. Buresh-Oppenheim} et al., Comput. Complexity 11, No. 3--4, 91--108 (2002; Zbl 1103.68564) Full Text: DOI