Pages that link to "Item:Q2274092"

The following pages link to A complexity theory for hard enumeration problems (Q2274092):

Displaying 22 items.

• Relation between the hardness of a problem and the number of its solutions (Q540772) (← links)
• Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
• Complexity of counting the optimal solutions (Q837174) (← links)
• On the power of enumerative counting (Q1199550) (← links)
• Enumerative counting is hard (Q1822963) (← links)
• Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
• On the dualization in distributive lattices and related problems (Q2030249) (← links)
• The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
• Enumerating teams in first-order team logics (Q2172832) (← links)
• Enumerating \(k\)-arc-connected orientations (Q2211357) (← links)
• Incremental delay enumeration: space and time (Q2274091) (← links)
• A complexity theory for hard enumeration problems (Q2274092) (← links)
• Enumeration results on linear complexity profiles and lattice profiles (Q2489145) (← links)
• Enumeration complexity of conjunctive queries with functional dependencies (Q3305356) (← links)
• On the Effective Enumerability of NP Problems (Q3499739) (← links)
• The Complexity and Distribution of Hard Problems (Q4834381) (← links)
• (Q5090998) (← links)
• (Q5738996) (redirect page) (← links)
• Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
• The statistical analysis for Sombor indices in a random polygonal chain networks (Q6110612) (← links)
• Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
• Generating minimal redundant and maximal irredundant subhypergraphs (Q6611070) (← links)