The following pages link to On the complexity of teaching (Q1892202):
Displaying 39 items.
- A characterization of approximation resistance for even k-partite CSPs (Q2986869) (← links)
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction (Q2986870) (← links)
- On the power of many one-bit provers (Q2986871) (← links)
- Approaching utopia (Q2986872) (← links)
- Learning and incentives in user-generated content (Q2986873) (← links)
- Welfare maximization and the supermodular degree (Q2986874) (← links)
- Reachability in graph timelines (Q2986875) (← links)
- Runtime guarantees for regression problems (Q2986877) (← links)
- An energy complexity model for algorithms (Q2986878) (← links)
- Streaming computations with a loquacious prover (Q2986880) (← links)
- Adversary lower bound for the k-sum problem (Q2986881) (← links)
- Stronger methods of making quantum interactive proofs perfectly complete (Q2986882) (← links)
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time (Q2986885) (← links)
- An equational approach to secure multi-party computation (Q2986886) (← links)
- Publicly verifiable proofs of sequential work (Q2986887) (← links)
- On the power of nonuniformity in proofs of security (Q2986888) (← links)
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889) (← links)
- Resource-based corruptions and the combinatorics of hidden diversity (Q2986890) (← links)
- Time hierarchies for sampling distributions (Q2986891) (← links)
- Properties and applications of boolean function composition (Q2986892) (← links)
- Pseudo-partitions, transversality and locality (Q2986893) (← links)
- Competing provers protocols for circuit evaluation (Q2986894) (← links)
- Catch them if you can (Q2986895) (← links)
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (Q2986896) (← links)
- Robust optimization in the presence of uncertainty (Q2986897) (← links)
- Sorting noisy data with partial information (Q2986898) (← links)
- New affine-invariant codes from lifting (Q2986899) (← links)
- H-wise independence (Q2986900) (← links)
- Sparse extractor families for all the entropy (Q2986901) (← links)
- On the power of conditional samples in distribution testing (Q2986902) (← links)
- Recent Developments in Algorithmic Teaching (Q3618563) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- (Q5053203) (← links)
- Learning qualitative constraint networks (Q5079789) (← links)
- On Polynomial Time Constructions of Minimum Height Decision Tree (Q5091026) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)
- Order compression schemes (Q5964067) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
- A note on hardness of computing recursive teaching dimension (Q6072213) (← links)
