"Optimal Fractal Coding is NP-Hard."

Matthias Ruhl, Hannes Hartenstein (1997)

Details and statistics

DOI: 10.1109/DCC.1997.582049

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

a service of  Schloss Dagstuhl - Leibniz Center for Informatics