Tree size reduction with keeping distinguishability

DOI10.1016/j.tcs.2017.08.017zbMath1407.68114OpenAlexW2749651546MaRDI QIDQ1630987

Zhipeng Cai, Xianmin Liu, Dongjing Miao, Jian-Zhong Li

Publication date: 5 December 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.08.017

zbMATH Keywords

reductiondistinguishabilitytree size

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (4)

Parameterized complexity of completeness reasoning for conjunctive queries ⋮ Range partitioning within sublinear time: algorithms and lower bounds ⋮ Range partitioning within sublinear time in the external memory model ⋮ Recognizing the tractability in big data computing

Cites Work

• Unnamed Item
• Ordered term tree languages which are polynomial time inductively inferable from positive data
• Learning \((k,l)\)-contextual tree languages for information extraction from web pages
• Tree pattern query minimization
• Efficient extraction of schemas for XML documents.
• On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
• Data Mining for the Category Management in the Retail Market
• Containment and equivalence for a fragment of XPath

This page was built for publication: Tree size reduction with keeping distinguishability