Computer Science MCQs (Set–27 | Level — Cryptography, Derandomization & Circuit Lower Bounds ๐๐ฅ)
- Get link
- X
- Other Apps
261. If one-way functions exist, then which class separation follows?
A) P = NP
B) P ≠ UP
C) NP = coNP
D) PSPACE = NP
Answer: B) P ≠ UP
262. The existence of pseudorandom generators implies:
A) P = NP
B) BPP ⊆ P/poly
C) BPP = P (under strong assumptions)
D) NP ⊆ BPP
Answer: C) BPP = P (under strong assumptions)
263. The Nisan–Wigderson framework connects:
A) Quantum computing and NP
B) Circuit lower bounds and derandomization
C) PCP and SAT
D) PSPACE and IP
Answer: B) Circuit lower bounds and derandomization
264. If NP has polynomial-size circuits, then the Polynomial Hierarchy:
A) Is infinite
B) Collapses to ฮฃ₂^P
C) Collapses to P
D) Equals PSPACE
Answer: B) Collapses to ฮฃ₂^P
265. The Karp–Lipton Theorem states that if NP ⊆ P/poly, then:
A) P = NP
B) PH collapses
C) PSPACE = NP
D) EXPTIME collapses
Answer: B) PH collapses
266. The Natural Proofs barrier (by Alexander Razborov and Steven Rudich) shows limitations in proving:
A) P ≠ PSPACE
B) Circuit lower bounds
C) ETH
D) BQP ⊆ PH
Answer: B) Circuit lower bounds
267. The class AM (Arthur–Merlin games) is known to be contained in:
A) NP
B) coNP
C) ฮ ₂^P
D) PSPACE
Answer: D) PSPACE
268. If EXP has polynomial-size circuits, then:
A) EXP = PSPACE
B) EXP = ฮฃ₂^P
C) EXP = MA
D) EXP collapses to P
Answer: B) EXP = ฮฃ₂^P
269. The hardness vs randomness paradigm suggests that strong circuit lower bounds imply:
A) P = NP
B) Derandomization
C) ETH fails
D) Quantum supremacy
Answer: B) Derandomization
270. The statement “NP ⊄ P/poly” would imply:
A) P ≠ NP
B) Strong circuit lower bounds
C) PH is infinite
D) EXP = NEXP
Answer: B) Strong circuit lower bounds
- Get link
- X
- Other Apps
Comments
Post a Comment