Pages that link to "Item:Q764325"
From MaRDI portal
The following pages link to Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325):
Displaying 5 items.
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Reconstructing weighted graphs with minimal query complexity (Q2431425) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Simple PCPs with poly-log rate and query complexity (Q3581427) (← links)
- Addendum to ``Choiceless polynomial time'' (Q5945399) (← links)