The computational complexity of antimatroid properties (Q5933438): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Introduction to Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of matroid properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphic matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Latest revision as of 16:16, 3 June 2024

scientific article; zbMATH DE number 1599046
Language Label Description Also known as
English
The computational complexity of antimatroid properties
scientific article; zbMATH DE number 1599046

    Statements

    The computational complexity of antimatroid properties (English)
    0 references
    0 references
    16 May 2001
    0 references
    oracle complexity for antimatroids
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers