Yuan Li, Alexander Razborov, Benjamin Rossman, “On the $AC^0$ Complexity of Subgraph Isomorphism”, SIAM Journal on Computing, 2017, Volume 46, Issue 3, Pages 936

SIAM Journal on Computing

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

SIAM Journal on Computing, 2017, Volume 46, Issue 3, Pages 936–971
DOI: https://doi.org/10.1137/14099721X (Mi siamc2)

This article is cited in 10 scientific papers (total in 10 papers)

On the $AC^0$ Complexity of Subgraph Isomorphism

Yuan Li^a, Alexander Razborov^bca, Benjamin Rossman^d

^a University of Chicago, Dept Comp Sci, Chicago, IL 60637 USA
^b Steklov Mathematical Institute of the Russian Academy of Sciences
^c Toyota Technological Institute at Chicago
^d National Institute of Informatics, Tokyo 1018430, Japan

Full-text PDF Citations (10)

DOI: https://doi.org/10.1137/14099721X

Funding agency	Grant number
Russian Foundation for Basic Research
Japan Science and Technology Agency ERATO
The second author was supported by the Russian Foundation for Basic Research. The third author was supported by the JST ERATO Kawarabayashi Large Graph Project.

Bibliographic databases:

Document Type: Article

Language: English

Linking options:

https://www.mathnet.ru/eng/siamc2

This publication is cited in the following 10 articles:

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles