Optimal query complexity bounds for finding graphs (Q991004): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2010.02.003 / rank
Normal rank
 
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.artint.2010.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048252940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a Hidden Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a Hidden Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Weighted Graphs with Minimal Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fourier spectrum of monotone functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a lemma of Littlewood and Offord / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Kolmogorov-Rogozin inequality for the concentration function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concentration function of a sum of independent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal reconstruction of graphs under the additive model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(B_ 2\)-sequences of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5839995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning and Verifying Graphs Using Queries with a Focus on Edge Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Estimate for Concentration Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Increase of Dispersion of Sums of Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatory Detection Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2010.02.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:34, 10 December 2024

scientific article
Language Label Description Also known as
English
Optimal query complexity bounds for finding graphs
scientific article

    Statements

    Optimal query complexity bounds for finding graphs (English)
    0 references
    0 references
    0 references
    2 September 2010
    0 references
    combinatorial search
    0 references
    combinatorial group testing
    0 references
    graph finding
    0 references
    coin weighing
    0 references
    Fourier coefficient
    0 references
    pseudo-Boolean function
    0 references
    Littlewood-Offord theorem
    0 references

    Identifiers