Trust Signal Map
Public graph snapshot linking moderation, structured review and trust-aware ranking.
Graph explorer
In this note we will introduce a class of search problems, called nested Polynomial Local Search (nPLS) problems, and show that definable NP search problems, i.e., $Σ^b_1$-definable functions in $T^2_2$ are characterized in terms of the nested PLS.
preprint / 2010