Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13222
Title: | On the complexity of intersecting finite state automata and NL versus NP |
Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών |
Keywords: | complexity class separations,nl,np,finite state automata intersection,space,time |
URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/13222 |
ISSN: | 0304-3975 |
Link: | <Go to ISI>://000183608800013 http://ac.els-cdn.com/S0304397502008307/1-s2.0-S0304397502008307-main.pdf?_tid=610c34ee-873f-11e3-8d47-00000aab0f6c&acdnat=1390819383_8cb4ebf5ca7cd5001a8bfc9357c9c764 |
Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Karakostas-2003-On the complexity of.pdf | 255.82 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License