On the Complexity of Extracting Subtree with Keeping Distinguishability (Q2958316): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jian-Zhong Li / rank
Normal rank
 
Property / author
 
Property / author: Jian-Zhong Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2545329740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient extraction of schemas for XML documents. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning \((k,l)\)-contextual tree languages for information extraction from web pages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered term tree languages which are polynomial time inductively inferable from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree pattern query minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Containment and equivalence for a fragment of XPath / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:31, 13 July 2024

scientific article
Language Label Description Also known as
English
On the Complexity of Extracting Subtree with Keeping Distinguishability
scientific article

    Statements

    On the Complexity of Extracting Subtree with Keeping Distinguishability (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    subtree extraction
    0 references
    distinguishability
    0 references
    computational complexity
    0 references
    0 references