default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 27
Volume 27, Number 1, March 2018
- Vikraman Arvind, Srikanth Srinivasan
:
On the hardness of the noncommutative determinant. 1-29 - Bruno Bauwens, Anton Makhlin, Nikolai K. Vereshchagin, Marius Zimand:
Short lists with short programs in short time. 31-61 - John M. Hitchcock, Hadi Shafei:
Autoreducibility of NP-Complete Sets under Strong Hypotheses. 63-97 - Tom Gur, Ron D. Rothblum:
Non-interactive proofs of proximity. 99-207
Volume 27, Number 2, June 2018
- Benjamin Rossman:
The Average Sensitivity of Bounded-Depth Formulas. 209-223 - Emanuele Viola, Avi Wigderson:
Local Expanders. 225-244 - Mika Göös, Toniann Pitassi, Thomas Watson:
The Landscape of Communication Complexity Classes. 245-304 - Oded Goldreich, Avishay Tal:
Matrix rigidity of random Toeplitz matrices. 305-350
Volume 27, Number 3, September 2018
- Leslie G. Valiant:
Some observations on holographic algorithms. 351-374 - Irit Dinur, Or Meir:
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. 375-462 - Badih Ghazi, Ilan Komargodski, Pravesh K. Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. 463-509 - Alexander A. Razborov:
On Space and Depth in Resolution. 511-559
Volume 27, Number 4, December 2018
- Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Constructive non-commutative rank computation is in deterministic polynomial time. 561-593 - Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost:
On semiring complexity of Schur polynomials. 595-616 - Anurag Pandey, Nitin Saxena, Amit Sinhababu:
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. 617-670 - Clément L. Canonne, Tom Gur:
An adaptivity hierarchy theorem for property testing. 671-716
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.
last updated on 2024-11-08 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
