ScholarLens Back to search
1998•SIAM Journal on ComputingRequires access

On Learning Read-k-Satisfy-j DNF

AizensteinHoward, BlumAvrim, KhardonRoni, KushilevitzEyal, PittLeonard, RothDan

Open publisher page 0 citations

Abstract

We study the learnability of read-k-satisfy-j (RkSj) DNF formulas. These are boolean formulas in disjunctive normal form (DNF), in which the maximum number of occurrences of a variable is bounded b...

About this research paper

What this paper is about

We study the learnability of read-k-satisfy-j (RkSj) DNF formulas. These are boolean formulas in disjunctive normal form (DNF), in which the maximum number of occurrences of a variable is bounded b...

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We study the learnability of read-k-satisfy-j (RkSj) DNF formulas. These are boolean formulas in disjunctive normal form (DNF), in which the maximum number of occurrences of a variable is bounded b...

Key concepts: Learnability, Mathematics, Bounded function, Disjunctive normal form, Boolean function, Discrete mathematics, Variable (mathematics), Combinatorics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On Learning Read-k-Satisfy-j DNF — Research Paper | ScholarLens