Alignment and distribution is not (always) NP-hard
From MaRDI portal
Publication:1862463
DOI10.1006/JPDC.2000.1683zbMath1010.68673MaRDI QIDQ1862463
Vincent Boudet, Fabrice Rastello, Yves Robert
Publication date: 19 March 2003
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://hal-lara.archives-ouvertes.fr/hal-02101994/file/RR1998-30.pdf
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
This page was built for publication: Alignment and distribution is not (always) NP-hard