AsOne
Problems
Log in
Sign up
Computational Complexity
Computational complexity theory focuses on classifying computational problems according to their inherent difficulty, and relating these classes to each other.
Create post
Join
Filter
University of Calgary
McMaster University
University of Waterloo
Springer
COVID-19
Math
Computer Science
Physics
Biology
Chemistry
Peer Reviewed
Awaiting Review
Nature
Science
Annals of Mathematics
Physical Review A
Discussion
Research
Active
Inactive
Clear All
Filter
Hot
New
Top
8
Computer Science
The P versus NP Problem - Official Problem Description
(claymath.org/sites/default/fil...)
a/pvsnp
·
Thomas Vu
· 1 year ago |
0 comments
1
Computer Science
P = NP?
(scottaaronson.com/papers/pnp.p...)
a/pvsnp
·
Thomas Vu
· 1 year ago |
0 comments
1
Math
Computer Science
Annals of Mathematics
Primes is in P
(annals.math.princeton.edu/2004...)
celarent
· 1 year ago |
0 comments
1
Computer Science
The Complexity Zoo
(complexityzoo.uwaterloo.ca/Com...)
shuhari
· 1 year ago |
0 comments
0
Computer Science
Proof complexity
a/pvsnp
·
rzach
· 1 year ago |
0 comments
a/complexity
2 Members
Created Feb 28, 2020
Create post
Join
Open problems
Riemann Hypothesis
P versus NP
Collatz Conjecture
Goldbach's Conjecture
Twin Prime Conjecture
ABC Conjecture
Hadwiger-Nelson Problem
Kalai's 3^d Conjecture
View all open problems →
About
Contact
Polymath Wiki
Moderator Guidelines
Terms & Privacy
© AsOne 2020