The following pages link to A theory of the learnable (Q3714486):
Displaying 50 items.
- 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)
- Natural Language Processing, Moving from Rules to Data (Q2988808) (← links)
- Learning $$AC^0$$ Under k-Dependent Distributions (Q2988821) (← links)
- On the relationship between diagnostic and checking tests of the read-once functions (Q3004818) (← links)
- How to Grow a Mind: Statistics, Structure, and Abstraction (Q3101800) (← links)
- An urn model from learning theory (Q3122906) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- The GGM Function Family Is a Weakly One-Way Family of Functions (Q3179353) (← links)
- Boosting the partial least square algorithm for regression modelling (Q3181328) (← links)
- Discriminative Reranking for Natural Language Parsing (Q3225425) (← links)
- Deductive learning (Q3334096) (← links)
- On the Nonlearnability of a Single Spiking Neuron (Q3370746) (← links)
- Bounds on the Sample Complexity for Private Learning and Private Data Release (Q3408209) (← links)
- BOOSTING-BASED FRAMEWORK FOR PORTFOLIO STRATEGY DISCOVERY AND OPTIMIZATION (Q3421880) (← links)
- SIMILARITY-BASED COMBINATION OF MULTIPLE CLUSTERINGS (Q3424489) (← links)
- DNA sequencing and string learning (Q3445271) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← links)
- Efficient Pseudorandom Functions via On-the-Fly Adaptation (Q3457117) (← links)
- The learnability of quantum states (Q3508097) (← links)
- Separating Models of Learning with Faulty Teachers (Q3520052) (← links)
- Parameterized Learnability of k-Juntas and Related Problems (Q3520054) (← links)
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries (Q3520065) (← links)
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries (Q3528413) (← links)
- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries (Q3528418) (← links)
- On learning monotone Boolean functions with irrelevant variables (Q3585190) (← links)
