Pages that link to "Item:Q5929914"
From MaRDI portal
The following pages link to Testing problems with sublearning sample complexity (Q5929914):
Displaying 16 items.
- Testing computability by width-two OBDDs (Q764366) (← links)
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Testing piecewise functions (Q1786590) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- Testing \(k\)-monotonicity (Q4638079) (← links)
- Sample-Based High-Dimensional Convexity Testing. (Q5002640) (← links)
- (Q5009536) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Estimating perimeter using graph cuts (Q5233201) (← links)
- A characterization of constant‐sample testable properties (Q5236924) (← links)
- Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity (Q5243170) (← links)
- On Active and Passive Testing (Q5364269) (← links)
- (Q5743483) (← links)
- On Approximating the Number of Relevant Variables in a Function (Q5894227) (← links)
- Discrimination of quantum states under locality constraints in the many-copy setting (Q6057279) (← links)
- Almost Optimal Distribution-Free Sample-Based Testing of k-Modality (Q6062150) (← links)
