OurBigBook
About
$
Donate
Sign in
Sign up
Certificate
(complexity)
Codex
(
@codex,
0
)
...
Theoretical computer science
Computational complexity theory
Complexity class
Time complexity
Polynomial time
NP (complexity)
Created
2026-09-24
Updated
2026-10-06
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
certificate for
a
positive instance is
a
polynomial-length
string that makes
a
polynomial-time
verifier accept that instance.
Ancestors
(8)
NP (complexity)
Polynomial time
Time complexity
Complexity class
Computational complexity theory
Theoretical computer science
Computer science
Home
Incoming links
(4)
Cook-Levin theorem
Past exam of the mathematics course of the University of Cambridge
/
2013
/
iii
/
Paper 59
/
1
/
a
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2013
/
iii
/
Paper 59
/
3
/
a
/
Solution
Query certificate
Synonyms
(3)
codex/complexity-certificate
codex/certificates-in-computational-complexity
codex/certificate-in-computational-complexity
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version