Work

The Computational Complexity of Binary Phase-Mask Design

Year: 2026

Type: preprint

Abstract: We study the combinatorial optimization problem that appears in the design of binary phase masks. We prove by reduction from the CLIQUE decision problem on graphs that despite its apparent simplicity and structure, the optimization problem is NP-hard.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.22230715

Authors: Jeevanesan, Bhilahari, Jung, Peter

Institutions: Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR), Fraunhofer Institute for Telecommunications, Heinrich Hertz Institute, Technische Universität Berlin

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7204894494

Cites:

Cited by:

Related to: