"Asymptotic and Exact Results on the Complexity of the ..."

Carsten Schneider, Robin Sulzgruber (2017)

> Home

Details and statistics

DOI: 10.37236/6354

access: closed

type: Journal Article

metadata version: 2022-06-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorics/SchneiderS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/SchneiderS17
Carsten Schneider, Robin Sulzgruber:
Asymptotic and Exact Results on the Complexity of the Novelli-Pak-Stoyanovskii Algorithm. Electron. J. Comb. 24(2): 2 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.