[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/mst/FennerGP09>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Brian_Postow>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Stephen_A._Fenner>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/William_I._Gasarch>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs00224-008-9111-4>
foaf:homepage <https://doi.org/10.1007/s00224-008-9111-4>
dc:identifier DBLP journals/mst/FennerGP09 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs00224-008-9111-4 (xsd:string)
dcterms:issued 2009 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/mst>
rdfs:label The Complexity of Finding SUBSEQ(A). (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Brian_Postow>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Stephen_A._Fenner>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/William_I._Gasarch>
swrc:number 3 (xsd:string)
swrc:pages 577-612 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/mst/FennerGP09/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/mst/FennerGP09>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/mst/mst45.html#FennerGP09>
rdfs:seeAlso <https://doi.org/10.1007/s00224-008-9111-4>
dc:subject Automaton; Automata theory; Context-free language; Context-free grammar; Computability; Turing degree; Computational complexity; Higman’s lemma; Subsequence; Bounded queries; Unbounded search; Recursive mathematics; Reverse mathematics (xsd:string)
dc:title The Complexity of Finding SUBSEQ(A). (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 45 (xsd:string)