Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An O(n^2) Time Algorithm for the Minimal Permutation Completion ..."

Christophe Crespelle, Anthony Perez, Ioan Todinca (2015)

> Home

Details and statistics

DOI: 10.1007/978-3-662-53174-7_8

access: closed

type: Conference or Workshop Paper

metadata version: 2018-09-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/CrespellePT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/CrespellePT15
Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem. WG 2015: 103-115

a service of

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.