English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory

MPS-Authors
/persons/resource/persons229250

Wellnitz,  Philip
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Roth, M., & Wellnitz, P. (2020). Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. In S. Chawla (Ed.), Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (pp. 2161-2180). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975994.133.


Cite as: http://hdl.handle.net/21.11116/0000-0005-8665-2
Abstract
There is no abstract available