71 citations · 455 across the 36 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016
On the complexity of probabilistic trials for hidden satisfiability problems
Itai Arad, Adam Bouland, Daniel Grier +3
What is the minimum amount of information and time needed to solve 2SAT? When the instance is known, it can be solved in polynomial time, but is this also possible without knowing…
cs.CC2016
Sensitivity Conjecture and Log-rank Conjecture for functions with small alternating numbers
Chengyu Lin, Shengyu Zhang
The Sensitivity Conjecture and the Log-rank Conjecture are among the most important and challenging problems in concrete complexity. Incidentally, the Sensitivity Conjecture is kno…