The Computational Complexity of Binary Phase-Mask Design

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.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-01
DOI
https://doi.org/10.5281/zenodo.22230715
Primary Topic
VLSI and FPGA Design Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The Computational Complexity of Binary Phase-Mask Design

Bhilahari Jeevanesan, Peter Jung
Zenodo (CERN European Organization for Nuclear Research)
VLSI and FPGA Design Techniques
preprint

The Computational Complexity of Binary Phase-Mask Design

Bhilahari Jeevanesan, Peter Jung
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Fraunhofer Institute for Telecommunications, Heinrich Hertz Institute (DE), Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR) (DE), Technische Universität Berlin (DE)
Peace, Justice and strong institutions
VLSI and FPGA Design Techniques
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.