Rational transductions and complexity of counting problems (Q5096829): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3664434 / 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: Q3859267 / 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: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient context-free parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic models and ambiguity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / 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: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homomorphism theorem for weighted context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 22:44, 29 July 2024

scientific article; zbMATH DE number 7573134
Language Label Description Also known as
English
Rational transductions and complexity of counting problems
scientific article; zbMATH DE number 7573134

    Statements

    Identifiers