


default search action
Theoretical Computer Science, Volume 715
Volume 715, March 2018
- Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik

:
Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability. 1-20 - Peter Jonsson, Johan Thapper:

Tractability conditions for numeric CSPs. 21-34 - Carla Negri Lintzmayer

, Guillaume Fertin
, Zanoni Dias:
Sorting permutations and binary strings by length-weighted rearrangements. 35-59 - Sang Duk Yoon, Min-Gyu Kim

, Wanbin Son, Hee-Kap Ahn
:
Geometric matching algorithms for two realistic terrains. 60-70 - Éric Duchêne, Marc Heinrich

, Urban Larsson, Aline Parreau:
The switch operators and push-the-button games: A sequential compound over rulesets. 71-85 - Claire Capdevielle, Colette Johnen

, Alessia Milani:
On the complexity of basic abstractions to implement consensus. 86-96

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














