A large lower bound on the query complexity of a simple Boolean function (Q1041802): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.2005.05.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042957148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Languages are Testable with a Constant Number of Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some 3CNF properties are hard to test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions that have read-once branching programs of quadratic size are not necessarily testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Combinatorial Programs and Efficient Property Testers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity testing over general poset domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing of matrix properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions that have read‐twice constant width branching programs are not necessarily testable / 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: Testing Membership in Languages that Have Small Width Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:39, 2 July 2024

scientific article
Language Label Description Also known as
English
A large lower bound on the query complexity of a simple Boolean function
scientific article

    Statements

    A large lower bound on the query complexity of a simple Boolean function (English)
    0 references
    0 references
    4 December 2009
    0 references
    computational complexity
    0 references
    branching programs
    0 references
    property testing
    0 references
    query complexity
    0 references
    randomized algorithms
    0 references

    Identifiers