Faster random generation of linear extensions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1998, Pages 350-354

  Bubley, Russ ^a   Dyer, Martin ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; MARKOV PROCESSES; THEOREM PROVING;

LINEAR EXTENSIONS;

RANDOM NUMBER GENERATION;

EID: 0032277731     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)