The algorithmic complexity of chemical threshold testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1203, Issue , 1997, Pages 205-216

  Damaschke, Peter ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

ALGORITHMIC COMPLEXITY; ASYMPTOTIC COMPLEXITY; ASYMPTOTICALLY OPTIMAL; CHEMICAL SUBSTANCE; CHEMICAL THRESHOLDS; CLOSE APPROXIMATION; EFFICIENT STRATEGY; THRESHOLD FUNCTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 84957684991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62592-5_73     Document Type: Conference Paper

References (13)

1. I.Altàöfer, E.Triesch: Edge search in graphs and hypergraphs of bounded rank, Discrete Math. 115 (1993), 1-9
2. J.A.Aslam, A.Dhagat: Searching in the presence of linearly bounded errors, 23th ACM STOC 1991, 486-493
3. A.Bar-Noy, F.K.Hwang, I.Kessler, S.Kutten: A new competitive algorithm for group testing, Discrete Applied Math. 52 (1994)
4. E.Boros, P.L.Hammer, T.Ibaraki, K.Kawakami: Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle, SIAM J. Computing, to appear
5. P.Damaschke: A tight upper bound for group testing in graphs, Discrete Applied Math. 48 (1994), 101-109
6. P.Damaschke: A parallel algorithm for nearly optimal edge search, Info. Proc. Letters 56 (1995), 233-236
7. P.Damaschke: Searching for faulty leaves in binary trees, in: M.Nagl (ed.), Graph-Theoretic Concepts in Computer Science-21st Int. Workshop WG'95, Aachen 1995, LNCS 1017 (Springer), 265-274
8. D.Z.Du, F.K.Hwang: Competitive group testing, Discrete Applied Math. 45 (1993)
9. K.Makino, T.Ibaraki: A fast and simple algorithm for identifying 2-monotonic positive Boolean functions, Proc. 6th ISAAC'95, LNCS 1004, Springer 1995, 291-300
10. D.Z.Du, H.Park: On competitive group testing, SIAM J. Comp. 23 (1994), 1019-1025
11. D.Z.Du, G.L.Xue, S.Z.Sun, S. W.Cheng: Modifications of competitive group testing, SIAM J. Comp. 23 (1994), 82-96
12. R.Reischuk: Einführung in die Komplexitätstheorie (in German), Teubner, Stuttgart 1990
13. E.Triesch: A group testing problem for hypergraphs of bounded rank, 1995, submitted