A lower bound for testing juntas (Q2390270): 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.ipl.2004.01.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074868939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing <i>k</i>-colorability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sublinear bipartiteness tester for bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank

Revision as of 19:02, 1 July 2024

scientific article
Language Label Description Also known as
English
A lower bound for testing juntas
scientific article

    Statements

    A lower bound for testing juntas (English)
    0 references
    0 references
    0 references
    21 July 2009
    0 references
    property testing
    0 references
    Boolean functions
    0 references
    computational complexity
    0 references
    randomized algorithms
    0 references

    Identifiers