Competitive learning of monotone Boolean functions

Sascha Kurz

REVIEW

Competitive learning of monotone Boolean functions

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1401.8135 v1 pith:BLHYU3AP submitted 2014-01-31 cs.DS cs.CCmath.OC

Sascha Kurz This is my paper · ORCID

classification cs.DScs.CCmath.OC

keywords booleancompetitivemonotoneproblemalgorithmsanalysisapplybesides

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We apply competitive analysis onto the problem of minimizing the number of queries to an oracle to completely reconstruct a given monotone Boolean function. Besides lower and upper bounds on the competitivity we determine optimal deterministic online algorithms for the smallest problem instances.

Discussion (0). Continue with ORCID to comment.

Pith tools