Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

7 relations
Computational complexity theoryDecision treeDecision tree modelNP (complexity)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
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… Expand
  • table 1
  • table 2
  • figure 2
  • figure 3
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… Expand
Is this relevant?
2011
2011
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
Abstract A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The… Expand
  • figure 1
Is this relevant?
2010
2010
Boolean functions with a simple certificate for CNF complexity
In this paper we study relationships between CNF representations of a given Boolean function f and essential sets of implicates… Expand
Is this relevant?
2008
2008
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate… Expand
Is this relevant?
2008
2008
A certifying algorithm for the path cover problem on interval graphs
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The… Expand
  • figure 1
Is this relevant?
2006
2006
Complexity parameters for first order classes
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
Quantum certificate complexity
  • Scott Aaronson
  • 18th IEEE Annual Conference on Computational…
  • 2002
    • Corpus ID: 14404709
Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate… Expand
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Certifying Model Checkers
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time… Expand
  • figure 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… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE