New Plain-exponential Time Classes for Graph Homomorphism

Wahlström, Magnus

doi:10.1007/s00224-010-9261-z

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

New Plain-exponential Time Classes for Graph Homomorphism

MPS-Authors

/persons/resource/persons45687

Wahlström, Magnus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Wahlström, M. (2011). New Plain-exponential Time Classes for Graph Homomorphism. Theory of Computing Systems, 49(2), 273-282. doi:10.1007/s00224-010-9261-z.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-11CA-B

Abstract

There is no abstract available