Pages that link to "Item:Q1894458"
From MaRDI portal
The following pages link to Learning Boolean read-once formulas over generalized bases (Q1894458):
Displaying 13 items.
- Read-once polynomial identity testing (Q496300) (← links)
- Learning read once functions using subcube parity queries (Q694278) (← links)
- An algorithm to learn read-once threshold formulas, and transformations between learning models (Q1327594) (← links)
- Optimal ordered binary decision diagrams for read-once formulas (Q1570838) (← links)
- Sums of read-once formulas: how many summands are necessary? (Q1686070) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Characterizing arithmetic read-once formulae (Q2828215) (← links)
- On the relationship between diagnostic and checking tests of the read-once functions (Q3004818) (← links)
- Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
- Locating Errors in Faulty Formulas (Q4972679) (← links)
- On some computations on sparse polynomials (Q5002654) (← links)
- Sums of Read-Once Formulas: How Many Summands Suffice? (Q5740191) (← links)
