Pages that link to "Item:Q1312183"

The following pages link to The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183):

Displaying 3 items.

• The complexity of debate checking (Q493647) (← links)
• The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
• Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)