English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

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.

Item is

Basic

show hide
Genre: Conference Paper
Latex : Pre-reduction Graph Products: {Hardnesses} of Properly Learning {DFA}s and Approximating {EDP} on {DAG}s

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Chalermsook, Parinya1, Author           
Laekhanukit, Bundit2, Author
Nanongkai, Danupon1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 201420142014
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: ChalermsookLN14
DOI: 10.1109/FOCS.2014.54
 Degree: -

Event

show
hide
Title: 55th Annual IEEE Symposium on Foundations of Computer Science
Place of Event: Philadelphia, PA, USA
Start-/End Date: 2014-10-18 - 2014-10-21

Legal Case

show

Project information

show

Source 1

show
hide
Title: FOCS 2014
  Abbreviation : FOCS 2014
  Subtitle : 55th Annual IEEE Symposium on Foundations of Computer Science ; Proceedings ; 18-21 October 2014 ; Philadelphia, Pennsylvania, USA
Source Genre: Proceedings
 Creator(s):
Bilof, Randall1, Editor
Bartosik, Mark1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Los Alamitos, CA : IEEE Computer Society
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 444 - 453 Identifier: ISBN: 978-1-4799-6517-5