default search action
Chicago Journal of Theoretical Computer Science, Volume 2016
Volume 2016, 2016
- Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood:
Layouts of Expander Graphs. - Thomas Watson:
Nonnegative Rank vs. Binary Rank. - Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism Polynomials Complete for VP. - Alex B. Grilo, Iordanis Kerenidis, Jamie Sikora:
QMA with Subset State Witnesses. - Laura Mancinska, David E. Roberson, Antonios Varvitsiotis:
On deciding the existence of perfect entangled strategies for nonlocal games. - Vikraman Arvind, S. Raja:
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. - Divesh Aggarwal, Oded Regev:
A Note on Discrete Gaussian Combinations of Lattice Vectors. - Raghav Kulkarni, Avishay Tal:
On Fractional Block Sensitivity. - Christopher T. Chubb, Steven T. Flammia:
Computing the Degenerate Ground Space of Gapped Spin Chains in Polynomial Time. - Arkadev Chattopadhyay, Frederic Green, Howard Straubing:
Circuit Complexity of Powering in Fields of Odd Characteristic. - Cécilia Lancien, Andreas J. Winter:
Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction. - Penghui Yao:
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. - André Chailloux, Gus Gutoski, Jamie Sikora:
Optimal bounds for semi-honest quantum oblivious transfer. - Yuval Filmus:
Friedgut-Kalai-Naor Theorem for Slices of the Boolean Cube.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.