Question

Two sets named for this term are equal if second-order logic is unaffected by the transitive closure operation on relations. In a proof about the permanent of a matrix, Leslie Valiant formulated a set named for this term prepended with a sharp sign. (10[1])Inductively constructing sets denoted “capital pi-sub-i” and “capital sigma-sub-i” using oracles produces a “hierarchy” named for this (-5[1])term. This term appears twice in the name of a class identified with the set of Turing machines “with advice” that has a slash in its name. Reductions with runtime described by this term identify “complete” problems (10[1])such as SAT (“sat”). Whether a class named (10[1])for this term is equal to its non-deterministic (10[1])counterpart (10[1])is the subject (10[2])of a Millennium Prize problem. (10[1])For 10 points, give this term that names the complexity class (10[1])P. ■END■ (10[2]0[5])

ANSWER: polynomial [accept P until it is read; accept polynomial time or polynomial space or polynomial hierarchy; accept NP or PH or P/poly or PSPACE or #P (“sharp-P”) until “P” is read]
<MY, Other Science>
= Average correct buzz position

Summary

Great Lakes2025-02-01Y667%0%0%116.00
Lower Mid-Atlantic2025-02-01Y1100%0%0%133.00
Midwest2025-02-01Y560%0%20%115.33
Northeast2025-02-01Y3100%0%0%89.33

Buzzes

PlayerTeamOpponentBuzz PositionValue
Nathan SheffieldMIT ABrown A4210
Alex AkridgeIndiana AWashU A59-5
Dennis YangMichigan CCase Western B9610
Adam FineChicago AIndiana B10310
Jerry ZhangHarvard BBrandeis A11110
June YinWashU BMissoui S&T11210
Xavier MigliaccioCarnegie Mellon ACarnegie Mellon B11510
Joy AnHarvard ABrandeis B11510
Simon ZimmermanOhio State AMichigan B12010
Jiping FangIllinois CChicago B13110
Peter BallasMichigan DKenyon1330
Elias KradelKenyonMichigan D1330
Aditya PatnaikOhio State BMichigan State1330
Todd MaslykMichigan ACase Western A13310
Ethan NewmanMichigan StateOhio State B1330
Noah ChinVirginia Tech AVirginia A13310
Akshar GoyalIllinois AChicago D1330