Tighter Upper Bounds on the Exact Complexity of String Matching

Authors:
Richard Cole;Ramesh Hariharan
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1997

Citing 0
Cited 2

On the Complexity of Determining the Period of a String

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Dynamic text and static pattern matching

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate two methods for proving lower bounds on the size of small-depth circuits, namely the approaches based on multiparty communication games and algebraic characterizations extending the concepts of the tensor rank and rigidity of matrices. ...