Pages that link to "Item:Q674290"
From MaRDI portal
The following pages link to Lower bounds for sampling algorithms for estimating the average (Q674290):
Displaying 18 items.
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- Lower bounds for sampling algorithms for estimating the average (Q674290) (← links)
- The query complexity of estimating weighted averages (Q766183) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- Learning distributions by their density levels: A paradigm for learning without a teacher (Q1370866) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- Metric-distortion bounds under limited information (Q2670934) (← links)
- A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Fully-Simulatable Oblivious Set Transfer (Q3511158) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Algorithmic Aspects of Property Testing in the Dense Graphs Model (Q4933381) (← links)
- On the Complexity of Sampling Vertices Uniformly from a Graph (Q5002838) (← links)
- (Q5875519) (← links)
- Testing Graph Blow-Up (Q5894224) (← links)
- Testing Graph Blow-Up (Q5894229) (← links)
