Toggle navigation
Collections
Fun
Jokes
Fortune
Photo
Nicknames
Blog
ﻮﺑﻻگ
Iran
The Algorithm For Finding The Longest Path In A Graph Is NP-complete.
Home
›
Fortune Cookies
›
Miscellaneous Collections
The algorithm for finding the longest path in a graph is NP-complete.
For you systems people, that means it's *real slow*.
-- Bart Miller
Related:
Why that little liar! I should have... And I was going to play pickle with him.
-- Homer, finding Bart's room empty, "Bart the Daredevil" (You need three people to play `pickle'....
NP- /N-P/ pref. Extremely. Used to modify adjectives describing a level or quality of difficulty
he connotation is often `more so than it should be' This is generalized from the computer-science terms `NP-hard' and `NP-complete'...
NP-: /N-P/ pref. Extremely. Used to modify adjectives describing a level or quality of difficulty
he connotation is often `more so than it should be' (NP-complete problems all seem to be very hard, but so far no one has found a good a priori reason that they should be....
And can you teach me to how to dance real slow?
GORS: GO Real Slow
Flight Reservation systems decide whether or not you exist.
If your information isn't in their database, then you simply don't get to go anywhere....
eal time 1. [techspeak] adj. Describes an application which requires a program to respond to stimuli within some small upper limit of response time (typically milli- or microseconds).
Process control at a chemical plant is the canonical example....
eal time: 1. [techspeak] adj. Describes an application which requires a program to respond to stimuli within some small upper limit of response time (typically milli- or microseconds).
Process control at a chemical plant is the classic example....
Real computer scientists love conventions. No one is expected to lug a 3081 attached to a bit map screen to a convention, so no one will ever know how slow their systems run.