ThreadSky
About ThreadSky
Log In
quantamagazine.bsky.social
•
18 days ago
Does P=NP? It’s one of the most fundamental problems in computer science. But, what is P? What is NP? We explain in our complexity class primer:
https://buff.ly/2zQbD7I
Comments
Log in
with your Bluesky account to leave a comment
[–]
chatzis28.bsky.social
•
18 days ago
Get primed on computational complexity and ready to tackle Scott Aaronson's diatribe (
https://en.wikipedia.org/wiki/Quantum_Computing_Since_Democritus
)
1
1
reply
[–]
chatzis28.bsky.social
•
18 days ago
Quanta Magazine's primer on computational complexity
https://bsky.app/profile/quantamagazine.bsky.social/post/3lhu2a5pa232u
0
reply
Posting Rules
Be respectful to others
No spam or self-promotion
Stay on topic
Follow Bluesky's terms of service
×
Reply
Post Reply
Comments