More efficient PAC-learning of DNF with membership queries under the uniform distribution (Q1878685): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2003.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075412780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning read-once formulas with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attribute-efficient learning in query and mistake-bound models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern cryptography, probabilistic proofs and pseudo-randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Decision Trees Using the Fourier Spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank

Latest revision as of 20:42, 6 June 2024

scientific article
Language Label Description Also known as
English
More efficient PAC-learning of DNF with membership queries under the uniform distribution
scientific article

    Statements