The complexity of computing maximal word functions

Journal article

Peer reviewed

The complexity of computing maximal word functions

Eric Allender, Danilo Bruschi and Giovanni Pighizzini

Computational complexity, Vol.3(4), pp.368-391

12/1993

DOI: https://doi.org/10.1007/BF01275489

Metrics

11 Record Views

See more details

Details

Title: The complexity of computing maximal word functions
Creators: Eric Allender
Danilo Bruschi
Giovanni Pighizzini
Publication Details: Computational complexity, Vol.3(4), pp.368-391
Date published: 12/1993
Academic Unit: Computer Science (SAS)
Language: English
Resource Type: Journal article
Identifiers: 991031654823404646