Pages that link to "Item:Q1816725"

The following pages link to On limited nondeterminism and the complexity of the V-C dimension (Q1816725):

Displaying 43 items.

• An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
• The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
• Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Aggregate operators in constraint query languages (Q696963) (← links)
• The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
• Strong computational lower bounds via parameterized complexity (Q856413) (← links)
• Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
• Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete (Q1305933) (← links)
• On the complexity of database queries (Q1307689) (← links)
• On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
• Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
• The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• Non-interactive proofs of proximity (Q1745962) (← links)
• On the complexity of approximating the VC dimension. (Q1872731) (← links)
• Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
• Random ubiquitous transformation semigroups (Q2009658) (← links)
• Margin of victory for tournament solutions (Q2060724) (← links)
• Finding kings in tournaments (Q2081490) (← links)
• Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
• Finding connected secluded subgraphs (Q2186823) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
• Narrow sieves for parameterized paths and packings (Q2396725) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
• Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
• The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
• Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
• NP-completeness: A retrospective (Q4571936) (← links)
• The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
• Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
• Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
• (Q5111877) (← links)
• The Bounded and Precise Word Problems for Presentations of Groups (Q5113919) (← links)
• Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
• Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← 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)
• Computing generating sets of minimal size in finite algebras (Q6108373) (← links)