All reports by Author György Turán:

__
TR05-023
| 16th February 2005
__

Robert H. Sloan, Balázs Szörényi, György Turán#### On k-term DNF with largest number of prime implicants

__
TR03-039
| 19th May 2003
__

Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán#### Theory Revision with Queries: Horn, Read-once, and Parity Formulas

__
TR98-061
| 29th September 1998
__

Robert H. Sloan, Ken Takata, György Turán#### On frequent sets of Boolean matrices

Robert H. Sloan, Balázs Szörényi, György Turán

It is known that a k-term DNF can have at most 2^k ? 1 prime implicants and this bound is sharp. We determine all k-term DNF having the maximal number of prime implicants. It is shown that a DNF is maximal if and only if it corresponds to a non-repeating ... more >>>

Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán

A theory, in this context, is a Boolean formula; it is

used to classify instances, or truth assignments. Theories

can model real-world phenomena, and can do so more or less

correctly.

The theory revision, or concept revision, problem is to

correct a given, roughly correct concept.

This problem is ...
more >>>

Robert H. Sloan, Ken Takata, György Turán

Given a Boolean matrix and a threshold t, a subset of the

columns is frequent if there are at least t rows having a 1 entry in

each corresponding position. This concept is used in the algorithmic,

combinatorial approach to knowledge discovery and data mining. We

consider the complexity aspects ...
more >>>