Endre Boros, Peter L. Hammer, Toshihide Ibaraki Kazuhiko Kawakami  Home/Search
Context Related
| rutgers.edu/~boros/...BHIK97SICOMP.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~boros/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We consider the problem of identifying an unknown Boolean function f by asking an oracle the functional values f(a) for a selected set of test vectors a # {0, 1} n . Furthermore, we assume that f is a positive (or monotone) function of n variables. It is not known yet whether the whole task of generating test vectors and checking if the identification is completed can be carried out in polynomial time in n and m or not, where m = | minT (f)| + | maxF (f)| and min T (f) (respectively,... (Update)
Similar documents based on text: More All
0.1: An Implementation of Logical Analysis of Data - Boros, Hammer, al. (1996) (Correct)
0.1: Logical Analysis of Numerical Data - Boros, Hammer, Ibaraki, Kogan (1997) (Correct)
0.1: Finding Small Sets of Essential Attributes in Binary Data - Boros, Horiyama, al. (2000) (Correct)
BibTeX entry: (Update)
E. Boros, P. L. Hammer, T. Ibaraki, and K. Kawakami. Polynomial time recognition of 2-monotonic positive boolean functions given by an oracle. SIAM Journal on Computing, 26:93--109, 1997. http://citeseer.ist.psu.edu/boros97polynomial.html More
@article{ boros97polynomialtime,
author = "Endre Boros and Peter L. Hammer and Toshihide Ibaraki and Kazuhiko Kawakami",
title = "Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle",
journal = "SIAM J. Comput.",
volume = "26",
number = "1",
pages = "93-109",
year = "1997",
url = "citeseer.ist.psu.edu/boros97polynomial.html" }
Citations (may not include all citations):493 Communications of ACM (context) - Valiant, of - 1984
441 Queries and concept learning (context) - Angluin - 1988
101 Threshold Logic and Its Applications (context) - Muroga - 1971
97 Learning read-once formulas with queries - Angluin, Hellerstein et al. - 1993
74 Exact learning via the monotone theory (context) - Bshouty - 1993
72 On generating all maximal independent sets (context) - Johnson, Yannakakis et al. - 1988
69 the complexity of dualization of monotone disjunctive normal.. (context) - Fredman, Khachiyan - 1994
67 Identifying the minimal transversals of a hypergraph and rel.. - Eiter, Gottlob - 1991
44 Complexity of identification and dualization of positive Boo.. (context) - Bioch, Ibaraki - 1995
28 Generating all maximal independent sets: NP-hardness and pol.. (context) - Lawler, Lenstra et al. - 1980
26 Learning arithmetic read-once formulas (context) - Bshouty, Hancock et al. - 1992
20 Dualization of regular Boolean functions (context) - Crama - 1987
18 The maximum latency and identification of positive Boolean f.. (context) - Makino, Ibaraki - 1994
17 Polynomial-time algorithms for regular set-covering and thre.. (context) - Peled, Simeone - 1985
16 time algorithm for computing the dual of a regular Boolean f.. (context) - Peled, Simeone et al. - 1994
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://rutcor.rutgers.edu/~boros/): More
Logical Analysis of Numerical Data - Boros, Hammer, Ibaraki, Kogan (2000) (Correct)
Combinatorial Problems Related to Origin-Destination.. - Boros, Hammer, Ricca.. (2000) (Correct)
An Incremental RNC Algorithm for Generating All Maximal.. - Boros, Elbassioni, al. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC