Skip to content
Problempedia archive

archive

Problempedia archive

Classic problems collected from published sources so there is something to solve from the first day. Each one names its source.

P versus NP Research level Computer science algorithmscomplexity-theory archive 3 weeks ago Unsolved

P is the class of decision problems that can be solved in polynomial time, and NP is the class of decision problems whose yes answers can be checked in polynomial time given a suitable certificate. Is P equal to NP? Equivalently, does some NP-complete problem, such as Boolean satisfiability, have a…

What physical process converts the collapse of a tiny gas bubble driven by intense sound waves in a liquid into a picosecond flash of visible/UV light, with the bubble's interior briefly reaching temperatures rivaling the Sun's surface or hotter?

All problems by archive