Last Updated
：2025/11/21
polynomial time
Quizzes for review
(mathematics) The complexity class where the runtime can be bounded (from above) by a polynomial in the input size.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
polynomial time
The algorithm decides graph isomorphism in polynomial time for many practical instances.
See correct answer
The algorithm decides graph isomorphism in polynomial time for many practical instances.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
