Tighter Lower Bounds on the Exact Complexity of String Matching

Cole, Richard; Hariharan, Ramesh; Paterson, Mike; Zwick, Uri

Item

ITEM ACTIONSEXPORT

DownloadE-Mail

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1331882_2

DetailsSummary

Tighter Lower Bounds on the Exact Complexity of String Matching

Cole, R., Hariharan, R., Paterson, M., & Zwick, U. (1995). Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM Journal on Computing, 24(1), 30-45.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ACDD-6 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ACDE-4

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Cole, Richard, Author
Hariharan, Ramesh¹, Author
Paterson, Mike, Author
Zwick, Uri, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1995

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517722
Other: Local-ID: C1256428004B93B8-3318197E2F53D3B5C125645A00352DF0-Hariharan-et-al95

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: SIAM Journal on Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 24 (1) Sequence Number: - Start / End Page: 30 - 45 Identifier: ISSN: 0097-5397