Congruence Closure of Compressed Terms in Polynomial Time (Q3172897): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Programming Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on the Common Subexpression Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding canonical sets of ground rewrite rules in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification and matching on compressed terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Unification on Compressed Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Second-Order Unification Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stratified Context Unification Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Bounded Second-Order Unification and Stratified Context Unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processing Compressed Texts: A Tractability Border / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems and Membership Problems on Compressed Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter Reduction in Grammar-Compressed Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Decision Procedures Based on Congruence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for reasoning about equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for generating reduced ground rewriting systems from a set of ground equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank

Latest revision as of 11:39, 4 July 2024

scientific article
Language Label Description Also known as
English
Congruence Closure of Compressed Terms in Polynomial Time
scientific article

    Statements

    Congruence Closure of Compressed Terms in Polynomial Time (English)
    0 references
    0 references
    0 references
    7 October 2011
    0 references
    term rewriting
    0 references
    grammar-based compression
    0 references
    singleton tree grammars
    0 references
    congruence closure
    0 references

    Identifiers