Pages that link to "Item:Q1305933"

The following pages link to Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete (Q1305933):

Displaying 10 items.

• The cycle discrepancy of three-regular graphs (Q659662) (← links)
• On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
• PAC learning, VC dimension, and the arithmetic hierarchy (Q892140) (← links)
• On the complexity of approximating the VC dimension. (Q1872731) (← links)
• A hierarchy of local decision (Q2219059) (← links)
• Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
• Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
• Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
• From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
• A note on hardness of computing recursive teaching dimension (Q6072213) (← links)