Certificate (complexity)

Known as: Certificate, Certificate complexity, Witness (complexity) 
In computational complexity theory, a certificate (also called a witness) is a string that certifies the answer to a computation, or certifies the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2017
02419962017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous… (More)
Is this relevant?
2016
2016
The sensitivity conjecture which claims that the sensitivity complexity is polynomially related to block sensitivity complexity… (More)
Is this relevant?
2016
2016
We provide new query complexity separations against sensitivity for total Boolean functions: a power 3 separation between… (More)
Is this relevant?
2015
2015
We show a power 2.5 separation between bounded-error randomized and quantum query complexity for a total Boolean function… (More)
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2015
2015
The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was… (More)
  • figure 1
Is this relevant?
2014
2014
Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding… (More)
Is this relevant?
2013
2013
Block sensitivity (bs(f)), certificate complexity (C(f)) and fractional certificate complexity (C*(f)) are three fundamental… (More)
Is this relevant?
2004
2004
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to… (More)
  • figure 1
  • figure 2
Is this relevant?
Review
2003
Review
2003
Given a Boolean function f , we study two natural generalizations of the certificate complexity C (f): the randomized certificate… (More)
  • table 1
Is this relevant?
1996
1996
Recent work in dynamic graph algorithms has led to efficient algorithms for dynamic undirected graph problems such as… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?