Journal: Computational Complexity

Volume 32, Issue 1

1 -- 0Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt. On sets of linear forms of maximal complexity
2 -- 0Rishabh Batra, Nitin Saxena 0001, Devansh Shringi. Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q
3 -- 0Prasad Chaugule, Mrinal Kumar 0001, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan 0001. Schur Polynomials Do Not Have Small Formulas If the Determinant does not
5 -- 0Ronen Shaltiel. Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?