Opening book details…
Can I read On the hardness of approximating the minimum consistent acyclic DFA and decision diagram on EtoBox?
On the hardness of approximating the minimum consistent acyclic DFA and decision diagram by Shinichi Shimozono; Kouichi Hirata; Ayumi Shinohara is a Computer Science article available to read on EtoBox.
What is On the hardness of approximating the minimum consistent acyclic DFA and decision diagram about?
We show that the problems to find the smallest acyclic DFA and OBDD with a fixed order of variables that are consistent with given sets of positive and negative examples are not approximable in polynomial time within worst case factors it 1/28 and .l/\*t, respectively, with the input size n unless P = NP.
Who reads On the hardness of approximating the minimum consistent acyclic DFA and decision diagram?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Shinichi Shimozono; Kouichi Hirata; Ayumi Shinohara
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0020-0190)
- Published
- 1998
- Language
- EN
- Field
- Computer Science (Physical Sciences)
More by Shinichi Shimozono; Kouichi Hirata; Ayumi Shinohara
Browse all works by Shinichi Shimozono; Kouichi Hirata; Ayumi Shinohara