Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325): 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.tcs.2011.09.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978657617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity / 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: Determining a Set from the Cardinalities of its Intersections with Other Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of a Subset from Certain Combinatorial Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302100 / 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: Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Combinatorial Problem in Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5535505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Möbius Functions and a Problem in Combinatorial Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information-theoretic method in combinatorial theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the performance of protocols for a multiple-access broadcast channel / rank
 
Normal rank
Property / cites work
 
Property / cites work: How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatory Detection Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:28, 4 July 2024

scientific article
Language Label Description Also known as
English
Toward a deterministic polynomial time algorithm with optimal additive query complexity
scientific article

    Statements

    Toward a deterministic polynomial time algorithm with optimal additive query complexity (English)
    0 references
    0 references
    0 references
    13 March 2012
    0 references
    combinatorial search
    0 references
    coin weighing problem
    0 references
    reconstructing hidden graphs
    0 references

    Identifiers