Pages that link to "Item:Q5916223"
From MaRDI portal
The following pages link to Exact learning of DNF formulas using DNF hypotheses (Q5916223):
Displaying 21 items.
- Learning nearly monotone \(k\)-term DNF (Q293322) (← links)
- On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
- DKL: an efficient algorithm for learning deterministic Kripke structures (Q824283) (← links)
- Fast learning of \(k\)-term DNF formulas with queries. (Q960515) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Complexity theoretic hardness results for query learning (Q1266164) (← links)
- Conjunctions of unate DNF formulas: Learning and structure (Q1383160) (← links)
- The learnability of exclusive-or expansions based on monotone DNF formulas (Q1575458) (← links)
- A subexponential exact learning algorithm for DNF using equivalence queries (Q1847366) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- Asking questions to minimize errors (Q1916529) (← links)
- On learning visual concepts and DNF formulae (Q1916881) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- Polynomial certificates for propositional classes (Q2495655) (← links)
- Read-twice DNF formulas are properly learnable (Q2508329) (← links)
- Learning to select branching rules in the DPLL procedure for satisfiability (Q2741536) (← links)
- A Canonical Form for Testing Boolean Function Properties (Q3088118) (← links)
- (Q3174124) (← links)
- Learning Theory (Q5473638) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
