Intellectual Olympiad in Algorithms and Programming Fundamentals - 2026 ongoing
1000 ₸
Subject: Algorithms and Programming Fundamentals Level: XII (I is easiest, XII is hardest)
Category: student
Question language: English
Questions: 15
Example question: A polynomial-time many-one reduction from decision problem A to decision problem B has been established. If A is NP-complete and B belongs to P, what follows? P equals co-NP, B is necessarily undecidable, P equals NP, A cannot be solved by a deterministic algorithm