Verification versus Search in Labeled Subcube Partitions: Exact Small-Width Bounds

The paper studies M(k), the maximum decision-tree complexity of a total unique search problem with witness size at most k, and determines the exact values M(1)=1, M(2)=2, M(3)=4 and M(4)=5 with a computer-assisted upper bound for width four.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-08
DOI
https://doi.org/10.5281/zenodo.22656747
Primary Topic
Constraint Satisfaction and Optimization
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Verification versus Search in Labeled Subcube Partitions: Exact Small-Width Bounds

Meryem Katircioglu
Zenodo (CERN European Organization for Nuclear Research)
Constraint Satisfaction and Optimization
preprint

Verification versus Search in Labeled Subcube Partitions: Exact Small-Width Bounds

Meryem Katircioglu
preprint en

Abstract

The paper studies M(k), the maximum decision-tree complexity of a total unique search problem with witness size at most k, and determines the exact values M(1)=1, M(2)=2, M(3)=4 and M(4)=5 with a computer-assisted upper bound for width four.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Constraint Satisfaction and Optimization
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.