Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover ..."

Radu Curticapean, Dániel Marx (2014)

> Home

Details and statistics

DOI: 10.1109/FOCS.2014.22

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/CurticapeanM14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/CurticapeanM14
Radu Curticapean, Dániel Marx:
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. FOCS 2014: 130-139

a service of

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.