Efficient iteration in admissible combinatorial classes (Q2581353): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exhaustive generation of combinatorial objects by ECO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of trees and other combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: ECO:a methodology for the enumeration of combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer algebra libraries for combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for the random generation of labelled combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating words lexicographically: An average-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic approach for the unranking of labeled combinatorial classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method and two algorithms on the theory of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm to generate necklaces with fixed content / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank

Latest revision as of 14:51, 11 June 2024

scientific article
Language Label Description Also known as
English
Efficient iteration in admissible combinatorial classes
scientific article

    Statements

    Efficient iteration in admissible combinatorial classes (English)
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    0 references
    Generation of combinatorial objects
    0 references
    Iteration in combinatorial classes
    0 references
    Unranking
    0 references
    Generation of combinatorial objects in lexicographic order
    0 references
    Constant amortized time
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references