On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions (Q5286060): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W17036322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and formal power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting problems and algebraic formal power series in noncommuting variables / 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: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pebble automata / 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: The complexity of ranking simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective entropies and data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4754499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of Parallel Random Access Machines by Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 17:10, 17 May 2024

scientific article; zbMATH DE number 223461
Language Label Description Also known as
English
On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
scientific article; zbMATH DE number 223461

    Statements

    On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    Turin machines
    0 references
    Kronecker product
    0 references
    direct sum over matrices
    0 references
    counting problem
    0 references

    Identifiers