The following pages link to What can be verified locally? (Q1672006):
Displaying 12 items.
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- What Can be Computed Locally? (Q4862796) (← links)
- Introduction to local certification (Q5024672) (← links)
- What can be decided locally without identifiers? (Q5176091) (← links)
- What Can be Sampled Locally? (Q5368952) (← links)
- A meta-theorem for distributed certification (Q6182681) (← links)
- Twenty-two new approximate proof labeling schemes (Q6535018) (← links)
- The hardness of local certification of finite-state dynamics (Q6547916) (← links)
- Locally verifiable distributed SNARGs (Q6581783) (← links)