The following pages link to Nader H. Bshouty (Q287181):
Displaying 50 items.
- A tight bound for approximating the square root (Q287183) (← links)
- On learning multivariate polynomials under the uniform distribution (Q290214) (← links)
- On learning width two branching programs (Q293246) (← links)
- Meeting times of random walks on graphs (Q294672) (← links)
- Learning Boolean halfspaces with small weights from membership queries (Q329608) (← links)
- Linear classifiers are nearly optimal when hidden variables have diverse effects (Q420914) (← links)
- On the additive complexity of 2 \(\times 2\) matrix multiplication (Q672835) (← links)
- Exact learning of formulas in parallel (Q677524) (← links)
- Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325) (← links)
- Maximizing agreements and coagnostic learning (Q817828) (← links)
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity (Q862343) (← links)
- Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
- A lower bound for the multiplication of polynomials modulo a polynomial (Q1197994) (← links)
- On the direct sum conjecture in the straight line model (Q1265137) (← links)
- On interpolating arithmetic read-once formulas with exponentiation (Q1267719) (← links)
- Learning matrix functions over rings (Q1271196) (← links)
- Attribute-efficient learning in query and mistake-bound models (Q1271616) (← links)
- Noise-tolerant parallel learning of geometric concepts (Q1281499) (← links)
- An algorithm to learn read-once threshold formulas, and transformations between learning models (Q1327594) (← links)
- Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
- Simple learning algorithms using divide and conquer (Q1355381) (← links)
- A note on prime \(n\)-tuples (Q1384866) (← links)
- On learning decision trees with large output domains (Q1386355) (← links)
- The monotone theory for the PAC-model. (Q1426003) (← links)
- Exact learning of juntas from membership queries (Q1663645) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- Exploring learnability between exact and PAC (Q1780447) (← links)
- A subexponential exact learning algorithm for DNF using equivalence queries (Q1847366) (← links)
- PAC learning with nasty noise. (Q1853516) (← links)
- Uniform-distribution attribute noise learnability (Q1877555) (← links)
- More efficient PAC-learning of DNF with membership queries under the uniform distribution (Q1878685) (← links)
- Learning Boolean read-once formulas over generalized bases (Q1894458) (← links)
- Asking questions to minimize errors (Q1916529) (← links)
- Oracles and queries that are sufficient for exact learning (Q1924380) (← links)
- An optimal tester for \(k\)-linear (Q2154097) (← links)
- Fast exponentiation using the truncation operation (Q2366170) (← links)
- Reconstructing weighted graphs with minimal query complexity (Q2431425) (← links)
- Learning with errors in answers to membership queries (Q2462498) (← links)
- Learning attribute-efficiently with corrupt oracles (Q2465035) (← links)
- Exact learning Boolean functions via the monotone theory (Q2506483) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- Lower bounds for cover-free families (Q2629487) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- An optimal tester for \(k\)-Linear (Q2690878) (← links)
- The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers (Q2830277) (← links)
- Non-adaptive Learning of a Hidden Hypergraph (Q2835619) (← links)
- Exact Learning from Membership Queries: Some Techniques, Results and New Directions (Q2859205) (← links)
- On r-Simple k-Path (Q2922590) (← links)
- Learning Boolean Halfspaces with Small Weights from Membership Queries (Q2938726) (← links)
- On Exact Learning Monotone DNF from Membership Queries (Q2938727) (← links)
