English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs

MPS-Authors
/persons/resource/persons44225

Chalermsook,  Parinya
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45102

Nanongkai,  Danupon
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

Chalermsook, P., Laekhanukit, B., & Nanongkai, D. (2014). Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. In R. Bilof, & M. Bartosik (Eds.), FOCS 2014 (pp. 444-453). Los Alamitos, CA: IEEE Computer Society. doi:10.1109/FOCS.2014.54.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0024-ABC5-C
Abstract
There is no abstract available