Work

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

Year: 2026

Type: preprint

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.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.22656746

Author: Katircioglu, Meryem

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: W7211978658

Cites:

Cited by:

Related to: