The following pages link to Teaching a smarter learner. (Q960469):
Displaying 25 items.
- 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)
- Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (Q3073646) (← links)
- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries (Q3528418) (← links)
- Recent Developments in Algorithmic Teaching (Q3618563) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Combinatorial results on the complexity of teaching and learning (Q5096898) (← links)
- Polynomial Identification of $$\omega $$-Automata (Q5164178) (← links)
- On the learnability of recursively enumerable languages from good examples (Q5941366) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)
- Inferring Symbolic Automata (Q6135753) (← links)
