Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.09.005
@@ Property / DOI: 10.1016/j.tcs.2011.09.005 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.09.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1978657617
@@ Property / OpenAlex ID: W1978657617 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994535
@@ Property / cites work: Q3994535 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity
+Normal rank
@@ Property / cites work @@
+Reconstructing Weighted Graphs with Minimal Query Complexity
+Normal rank
@@ Property / cites work @@
+Determining a Set from the Cardinalities of its Intersections with Other Sets
+Normal rank
@@ Property / cites work @@
+Determination of a Subset from Certain Combinatorial Properties
+Normal rank
@@ Property / cites work @@
+Q5302100
@@ Property / cites work: Q5302100 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal reconstruction of graphs under the additive model
+Normal rank
@@ Property / cites work @@
+Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
+Normal rank
@@ Property / cites work @@
+Q4218421
@@ Property / cites work: Q4218421 / rank @@
+Normal rank
@@ Property / cites work @@
+On a Combinatorial Problem in Number Theory
@@ Property / cites work: On a Combinatorial Problem in Number Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5535505
@@ Property / cites work: Q5535505 / rank @@
+Normal rank
@@ Property / cites work @@
+On Möbius Functions and a Problem in Combinatorial Number Theory
+Normal rank
@@ Property / cites work @@
+Q4109144
@@ Property / cites work: Q4109144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417652
@@ Property / cites work: Q5417652 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4081256
@@ Property / cites work: Q4081256 / rank @@
+Normal rank
@@ Property / cites work @@
+An information-theoretic method in combinatorial theory
+Normal rank
@@ Property / cites work @@
+Bounds on the performance of protocols for a multiple-access broadcast channel
+Normal rank
@@ Property / cites work @@
+How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback
+Normal rank
@@ Property / cites work @@
+A Combinatory Detection Problem
@@ Property / cites work: A Combinatory Detection Problem / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.09.005
@@ Property / DOI: 10.1016/J.TCS.2011.09.005 / rank @@
+Normal rank