English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Fine-Grained Analogue of Schaefer’s Theoremin P: Dichotomy of ∃k∀-Quantified First-OrderGraph Properties

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons242908

Fischer,  Nick
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44857

Künnemann,  Marvin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., Fischer, N., & Künnemann, M. (2019). A Fine-Grained Analogue of Schaefer’s Theoremin P: Dichotomy of ∃k∀-Quantified First-OrderGraph Properties. In A. Shpilka (Ed.), 34th Computational Complexity Conference (pp. 1-27). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.CCC.2019.31.


Cite as: http://hdl.handle.net/21.11116/0000-0005-1FAF-5
Abstract
There is no abstract available