Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 32
Volume 32, Number 1, June 2023
- Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt:
On sets of linear forms of maximal complexity. 1 - Rishabh Batra, Nitin Saxena, Devansh Shringi
:
Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q. 2 - Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials Do Not Have Small Formulas If the Determinant does not. 3 - Jin-Yi Cai, Zhiguo Fu, Kurt Girstmair, Michael Kowalczyk:
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory. 4 - Ronen Shaltiel:
Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? 5
Volume 32, Number 2, December 2023
- Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
The Power of Natural Properties as Oracles. 6 - Olivier Bournez, Arnaud Durand:
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations. 7 - Pascal Koiran, Subhayan Saha:
Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond. 8 - Ashrujit Ghoshal, Ilan Komargodski:
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. 9 - Caroline Mattes, Armin Weiß:
Parallel algorithms for power circuits and the word problem of the Baumslag group. 10 - Oded Goldreich, Dana Ron:
A Lower Bound on the Complexity of Testing Grained Distributions. 11 - Ilario Bonacina, Nicola Galesi, Massimo Lauria:
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. 12 - Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
Improving 3N Circuit Complexity Lower Bounds. 13
a service of 
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-04-30 20:49 CEST 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:
