Tag: search-problem

Found 22 results for 'search-problem'.

1) cc.complexity-theory - Above #P and counting search problems
2) cc.complexity-theory - Does existence of a total $\mathsf{NP}$ search problem not solvable in polytime imply $\mathsf{NP}\cap\mathsf{coNP} \neq \mathsf{P}$?
3) graph-isomorphism - Does Babai's quasipolynomial time $\mathsf{GI}$ algorithm actually generate the isomorphism?
4) cc.complexity-theory - Does PPAD really capture the notion of finding another unbalanced vertex?
5) ds.algorithms - A search problem and no algorithm for it
6) optimization - Questions about Farhi's pre-Adiabatic paper
7) approximation-algorithms - Approximation Ratio of Local search for $k-$center problem
8) reductions - Why is the "general notion of a reduction [...] inherent to the notion of self-reducibility"?
9) cc.complexity-theory - Find a string with minimal edit distance from a set of given strings
10) cc.complexity-theory - Literature reference for search-BPP
11) ds.algorithms - Worst number of questions needed to learn a monotonic predicate over a poset
12) search-problem - Biased binary search?
13) ds.algorithms - Minimal elements of a monotonic predicate over the powerset $2^{|n|}$
14) pr.probability - The use of crossovers in Genetic Algorithm
15) search-problem - Is generalized pigeonhole search known to be no harder than PPP?
16) quantum-computing - Oracle Construction for Grover's Algorithm
17) gt.game-theory - Minmax vs Maxmin
18) sat - Complexity of the search version of 2-SAT assuming $\mathsf{L = NL}$
19) cc.complexity-theory - How to find a non-zero point of a non-zero polynomial of low degree?
20) cr.crypto-security - Can a random oracle change which TFNP problems are strongly hard-on-average?
21) np-hardness - Is there a FNP problem that's NP-hard but not FNP-hard?
22) randomized-algorithms - Efficiently picking free position from array with uniform probability.