default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 240
Volume 240, February 2015
- Krishnendu Chatterjee, Jirí Sgall
:
Special Issue for the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg, Austria. 1 - Sébastien Tavenas:
Improved bounds for reduction to depth 4 and depth 3. 2-11 - Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal indices for predecessor search. 12-30 - Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. 31-41 - Leonid Gurvits:
Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications. 42-55 - Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii:
Polynomial threshold functions and Boolean threshold circuits. 56-73 - Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting regularities on grammar-compressed strings. 74-89 - Orna Kupferman, Jonathan Mosheiff:
Prime languages. 90-107 - Thomas Zeume, Thomas Schwentick:
On the quantifier-free dynamic complexity of Reachability. 108-129
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 2025-02-25 23:56 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:
