Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SEARCH-TO-DECISION REDUCTIONS:
Reports tagged with search-to-decision reductions:
TR12-002 | 4th January 2012
Akinori Kawachi, Benjamin Rossman, Osamu Watanabe

Query Complexity and Error Tolerance of Witness Finding Algorithms

Revisions: 3

We propose an abstract framework for studying search-to-decision reductions for NP. Specifically, we study the following witness finding problem: for a hidden nonempty set $W\subseteq\{0,1\}^n$, the goal is to output a witness in $W$ with constant probability by making randomized queries of the form ``is $Q\cap W$ nonempty?''\ where $Q\subseteq\{0,1\}^n$. ... more >>>


TR21-041 | 15th March 2021
Zhenjian Lu, Igor Carboni Oliveira

An Efficient Coding Theorem via Probabilistic Representations and its Applications

A probabilistic representation of a string $x \in \{0,1\}^n$ is given by the code of a randomized algorithm that outputs $x$ with high probability [Oliveira, ICALP 2019]. We employ probabilistic representations to establish the first unconditional Coding Theorem in time-bounded Kolmogorov complexity. More precisely, we show that if a distribution ... more >>>


TR21-141 | 28th September 2021
Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz

On the (im)possibility of branch-and-bound search-to-decision reductions for approximate optimization

Revisions: 1

We study a natural and quite general model of branch-and-bound algorithms. In this model, an algorithm attempts to minimize (or maximize) a function $f : D \to \mathbb{R}_{\geq 0}$ by making oracle queries to a heuristic $h_f$ satisfying
\[
\min_{x \in S} f(x) \leq h_f(S) \leq \gamma \cdot ... more >>>


TR24-059 | 4th April 2024
Shuichi Hirahara, Valentine Kabanets, Zhenjian Lu, Igor Oliveira

Exact Search-to-Decision Reductions for Time-Bounded Kolmogorov Complexity

A search-to-decision reduction is a procedure that allows one to find a solution to a problem from the mere ability to decide when a solution exists. The existence of a search-to-decision reduction for time-bounded Kolmogorov complexity, i.e., the problem of checking if a string $x$ can be generated by a ... more >>>




ISSN 1433-8092 | Imprint