Journal: Computational Complexity

Volume 25, Issue 4

723 -- 735Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita. Quantum Query Complexity of Almost All Functions with Fixed On-set Size
737 -- 773Yuichi Yoshida. Testing list H-homomorphisms
775 -- 814Michael Blondin, Andreas Krebs, Pierre McKenzie. The complexity of intersecting finite automata having few final states
815 -- 848Laurent Evain, Mathias Lederer, Bjarke Hammersholt Roune. Connect Four and Graph Decomposition
849 -- 881Yasuhiro Takahashi, Seiichiro Tani. Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits
883 -- 919Andrew Hughes, Debasis Mandal, Aduri Pavan, Nathan Russell, Alan L. Selman. A thirty Year old conjecture about promise problems
921 -- 931Jean Bourgain, Zeev Dvir, Ethan Leeman. Affine extractors over large fields with exponential error