4 ms·
You can make a problem that is hard to compute but easy to verify. You can also go by known big-oh computation complexity estimates how long it would take you o
by Beltiras 7y ago
You can make a problem that is hard to compute but easy to verify. You can also go by known big-oh computation complexity estimates how long it would take you on a classical computer. Not too hard to prove.