"The Descriptive Complexity of Subgraph Isomorphism Without Numerics."

Oleg Verbitsky, Maksim Zhukovskii (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-58747-9_27

access: closed

type: Conference or Workshop Paper

metadata version: 2024-04-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/csr/VerbitskyZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/VerbitskyZ17
Oleg Verbitsky, Maksim Zhukovskii:
The Descriptive Complexity of Subgraph Isomorphism Without Numerics. CSR 2017: 308-322

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.