From the Complexity of Infinite Permutations to the Profile of Bichains - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2008

From the Complexity of Infinite Permutations to the Profile of Bichains

Thierry Monteil
  • Function : Author
  • PersonId : 938552
No file

Dates and versions

lirmm-00434328 , version 1 (22-11-2009)

Identifiers

  • HAL Id : lirmm-00434328 , version 1

Cite

Thierry Monteil. From the Complexity of Infinite Permutations to the Profile of Bichains. ROGICS'08: International Conference on Relations, Orders and Graphs: Interaction with Computer Science, May 2008, Mahdia, Tunisia. pp.1-6. ⟨lirmm-00434328⟩
51 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More