P-complete
(computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P.
Not sensible; silly, foolish. / That cannot be sensed; imperceptible. / Out of one's senses; unconscious.
Non-Oxford British English standard spelling of salinize.
A surname.
回路値問題はPクラスにおける完全問題であり、Pに属する任意の問題を多項式時間の写像でそれに還元できることが示されています。
Don't have an account? Sign up
Do you have an account? Login
DiQt
Free
★★★★★★★★★★
