Cavalar, Bruno Pasqualotto; Kumar, Mrinal; Rossman, Benjamin Monotone circuit lower bounds from robust sunflowers. (English) Zbl 07628949 Algorithmica 84, No. 12, 3655-3685 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{B. P. Cavalar} et al., Algorithmica 84, No. 12, 3655--3685 (2022; Zbl 07628949) Full Text: DOI
Buhrman, Harry; Christandl, Matthias; Koucký, Michal; Lotker, Zvi; Patt-Shamir, Boaz; Vereshchagin, Nikolay High entropy random selection protocols. (English) Zbl 1512.68087 Algorithmica 83, No. 2, 667-694 (2021). MSC: 68P30 68Q10 68Q11 68W20 PDFBibTeX XMLCite \textit{H. Buhrman} et al., Algorithmica 83, No. 2, 667--694 (2021; Zbl 1512.68087) Full Text: DOI Link
Dell, Holger AND-compression of NP-complete problems: streamlined proof and minor observations. (English) Zbl 1350.68118 Algorithmica 75, No. 2, 403-423 (2016). MSC: 68Q17 05C65 68Q12 68Q25 94A17 PDFBibTeX XMLCite \textit{H. Dell}, Algorithmica 75, No. 2, 403--423 (2016; Zbl 1350.68118) Full Text: DOI arXiv
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi A completeness theory for polynomial (Turing) kernelization. (English) Zbl 1312.68102 Algorithmica 71, No. 3, 702-730 (2015). MSC: 68Q25 68Q15 68Q17 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Algorithmica 71, No. 3, 702--730 (2015; Zbl 1312.68102) Full Text: DOI
Iwama, Kazuo; Morizumi, Hiroki; Tarui, Jun Negation-limited complexity of parity and inverters. (English) Zbl 1200.94063 Algorithmica 54, No. 2, 256-267 (2009). MSC: 94C05 PDFBibTeX XMLCite \textit{K. Iwama} et al., Algorithmica 54, No. 2, 256--267 (2009; Zbl 1200.94063) Full Text: DOI