"Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism."

Oleg Verbitsky, Maksim Zhukovskii (2019)

> Home

Details and statistics

DOI: 10.1145/3303881

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tocl/VerbitskyZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/VerbitskyZ19
Oleg Verbitsky, Maksim Zhukovskii:
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism. ACM Trans. Comput. Log. 20(2): 9:1-9:18 (2019)

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.