RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
Main page
About this project
Software
Classifications
Links
Terms of Use

Search papers
Search references

RSS
Current issues
Archive issues
What is RSS






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


SIAM J. Comput., 2017, Volume 46, Issue 3, Pages 936–971 (Mi siamc2)  

On the $AC^0$ Complexity of Subgraph Isomorphism

Yuan Lia, Alexander Razborovbca, Benjamin Rossmand

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

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.


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


Bibliographic databases:

Language:

Linking options:
  • http://mi.mathnet.ru/eng/siamc2

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:60

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020