FAQ

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

Related topics

Related topics

7 relations

Broader (1)

Computational complexity theory
Decision treeDecision tree modelNP (complexity)P versus NP problem
(More)

Related mentions per year

Related mentions per year

1956-2018
1960198020002020
Certificate (complexity)
Computational complexity theory
Decision tree
NP (complexity)
P versus NP problem
Decision tree model

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Sensitivity Versus Certificate Complexity of Boolean Functions
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous… (More)
Is this relevant?
2016
2016
A Tighter Relation between Sensitivity and Certificate Complexity
The sensitivity conjecture which claims that the sensitivity complexity is polynomially related to block sensitivity complexity… (More)
Is this relevant?
2016
2016
Low-Sensitivity Functions from Unambiguous Certificates
We provide new query complexity separations against sensitivity for total Boolean functions: a power 3 separation between… (More)
Is this relevant?
2015
2015
Separations in query complexity using cheat sheets
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
Separating Decision Tree Complexity from Subcube Partition Complexity
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
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding… (More)
Is this relevant?
2013
2013
Composition Limits and Separating Examples for Some Boolean Function Complexity Measures
Block sensitivity (bs(f)), certificate complexity (C(f)) and fractional certificate complexity (C*(f)) are three fundamental… (More)
Is this relevant?
2004
2004
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
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
Quantum Certificate Complexity
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
On Certificates and Lookahead in Dynamic Graph Problems
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?