Guided inference of nested monotone Boolean functions

This paper addresses the problem of minimizing the average query complexity of inferring a pair of nested monotone Boolean functions defined on {0,1} n using a pair of oracles. Here, nested refers to the case when one of the functions is always greater than or equal to the other function. It is show...

Full description

Bibliographic Details

Published in:	Information sciences Vol. 151; pp. 171 - 200
Main Authors:	Torvik, Vetle I, Triantaphyllou, Evangelos
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2003
Subjects:	Average query complexity Guided inference Membership queries Nested monotone Boolean functions Partially ordered sets (posets) Query selection criteria Guided inference Membership queries Nested monotone Boolean functions Average query complexity Partially ordered sets (posets) Query selection criteria
ISSN:	0020-0255, 1872-6291
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!