Pages that link to "Item:Q1897365"
From MaRDI portal
The following pages link to On specifying Boolean functions by labelled examples (Q1897365):
Displayed 50 items.
- On teaching sets of \(k\)-threshold functions (Q342728) (← links)
- On the number of irreducible points in polyhedra (Q343724) (← links)
- Improved approximation of linear threshold functions (Q371200) (← links)
- Teaching randomized learners with feedback (Q553294) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- DNF are teachable in the average case (Q1009216) (← links)
- On the limits of efficient teachability (Q1603392) (← links)
- Linear read-once and related Boolean functions (Q1801039) (← links)
- The Vapnik-Chervonenkis dimension of a random graph (Q1842142) (← links)
- On data classification by iterative linear partitioning (Q1885803) (← links)
- Witness sets for families of binary vectors (Q1906149) (← links)
- On Boolean threshold functions with minimum specification number (Q2105416) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- Massive online teaching to bounded learners (Q2986853) (← links)
- Learning mixtures of spherical gaussians (Q2986854) (← links)
- Low-weight halfspaces for sparse boolean vectors (Q2986855) (← links)
- Learnability of DNF with representation-specific queries (Q2986856) (← links)
- Can theories be tested? (Q2986857) (← links)
- Making evolution rigorous (Q2986858) (← links)
- On the convergence of the Hegselmann-Krause system (Q2986859) (← links)
- Is privacy compatible with truthfulness? (Q2986860) (← links)
- Differentially private data analysis of social networks via restricted sensitivity (Q2986861) (← links)
- Characterizing the sample complexity of private learners (Q2986862) (← links)
- Barriers in cryptography with weak, correlated and leaky sources (Q2986863) (← links)
- On the possibilities and limitations of pseudodeterministic algorithms (Q2986864) (← links)
- Evasiveness through a circuit lens (Q2986865) (← links)
- The garden-hose model (Q2986866) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
- Towards an optimal query efficient PCP? (Q2986868) (← links)
- 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)