Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13222Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Karakostas, G. | en |
| dc.contributor.author | Lipton, R. J. | en |
| dc.contributor.author | Viglas, A. | en |
| dc.date.accessioned | 2015-11-24T17:26:32Z | - |
| dc.date.available | 2015-11-24T17:26:32Z | - |
| dc.identifier.issn | 0304-3975 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13222 | - |
| dc.rights | Default Licence | - |
| dc.subject | complexity class separations | en |
| dc.subject | nl | en |
| dc.subject | np | en |
| dc.subject | finite state automata intersection | en |
| dc.subject | space | en |
| dc.subject | time | en |
| dc.title | On the complexity of intersecting finite state automata and NL versus NP | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | Doi 10.1016/S0304-3975(02)00830-7 | - |
| heal.identifier.secondary | <Go to ISI>://000183608800013 | - |
| heal.identifier.secondary | http://ac.els-cdn.com/S0304397502008307/1-s2.0-S0304397502008307-main.pdf?_tid=610c34ee-873f-11e3-8d47-00000aab0f6c&acdnat=1390819383_8cb4ebf5ca7cd5001a8bfc9357c9c764 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2003 | - |
| heal.abstract | We consider uniform and non-uniform assumptions for the hardness of an explicit problem from finite state automata theory. First we show that a small improvement in the known straightforward algorithm for this problem can be used to design faster algorithms for subset sum and factoring, and improved deterministic simulations for non-deterministic time. On the other hand, we can use the same improved algorithm for our FSA problem to prove complexity class separation results (NL is not equal to P, or NP for the non-uniform case). This result can be viewed either as a hardness result for the FSA intersection problem, or as a method for separating NL from P or NP. It is interesting to note that this approach is based on a more general method for separating two complexity classes, using algorithms rather than lower bounds. (C) 2002 Elsevier Science B.V. All rights reserved. | en |
| heal.journalName | Theoretical Computer Science | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| 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
