Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Academic Journal

A complexity theorem for the Novelli–Pak–Stoyanovskii algorithm.

  • Source: Journal of Combinatorial Theory - Series A. Oct2015, Vol. 135, p85-104. 20p.

تفاصيل العنوان

×
  • 1-1 of  1 نتائج ل ""Neumann, Christoph""