The following pages link to (Q3355236):
Displaying 18 items.
- The complexity of debate checking (Q493647) (← links)
- Best-order streaming model (Q534570) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- Ensuring the quasi-termination of needed narrowing computations (Q845935) (← links)
- Checking the correctness of memories (Q890427) (← links)
- Batch checking with applications to linear functions (Q1198028) (← links)
- On games of incomplete information (Q1199525) (← links)
- Streaming graph computations with a helpful advisor (Q1939657) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
- (Q5002633) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)
- Logspace verifiers, NC, and NP (Q6487945) (← links)
- Fiat-Shamir security of FRI and related SNARKs (Q6562558) (← links)
