The complexity of computing maximal word functions (Q1321032): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/cc/AllenderBP93, #quickstatements; #temporary_batch_1731543907597
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Eric W. Allender / rank
Normal rank
 
Property / author
 
Property / author: Eric W. Allender / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61677541 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudimentary reductions revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth reduction for noncommutative arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Printable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very hard log-space counting class / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and formal power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the number of strings of given length in context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Applications of Inductive Counting for Complementation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Parallel Algorithm for Formula Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression and Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding Fan-out in Logical Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of ranking simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Efficient Generation of Language Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties that characterize LOGCFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two dynamic programming algorithms for which interpreted pebbling helps / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/cc/AllenderBP93 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:34, 14 November 2024

scientific article
Language Label Description Also known as
English
The complexity of computing maximal word functions
scientific article

    Statements

    The complexity of computing maximal word functions (English)
    0 references
    0 references
    0 references
    0 references
    8 May 1994
    0 references
    data retrieval
    0 references
    ranking
    0 references
    data compression
    0 references
    parallel algorithm
    0 references
    maximal word functions
    0 references
    one-way nondeterministic auxiliary pushdown automata
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references