Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Minimum Consistent DFA Problem Cannot be Approximated within any ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Leonard Pitt, Manfred K. Warmuth (1993)

> Home

Details and statistics

DOI: 10.1145/138027.138042

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/PittW93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/PittW93
Leonard Pitt, Manfred K. Warmuth:
The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial. J. ACM 40(1): 95-142 (1993)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.