Pages that link to "Item:Q1202891"

The following pages link to On the complexity of inferring functional dependencies (Q1202891):

Displaying 29 items.

• Improved time complexities for learning Boolean networks (Q280576) (← links)
• Mining approximate interval-based temporal dependencies (Q329410) (← links)
• Approximate inference of functional dependencies from relations (Q672339) (← links)
• On the complexity of finding bounds for projection cardinalities in relational databases (Q688287) (← links)
• Performance analysis of a greedy algorithm for inferring Boolean functions (Q834975) (← links)
• Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
• On the complexities of consistency checking for restricted UML class diagrams (Q1044829) (← links)
• Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions (Q1741131) (← links)
• Algorithms for computing the Shapley value of cooperative games on lattices (Q1800390) (← links)
• Inferring minimal functional dependencies in Horn and q-Horn theories (Q1810895) (← links)
• A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis (Q1870542) (← links)
• Computing premises of a minimal cover of functional dependencies is intractable (Q1946215) (← links)
• Reducing one class of machine learning algorithms to logical operations of plausible reasoning (Q2017512) (← links)
• The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
• On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
• Reasoning about functional and full hierarchical dependencies over partial relations (Q2446453) (← links)
• Functional and multivalued dependencies in nested databases generated by record and list constructor (Q2502161) (← links)
• On the Complexity of Insertion Propagation with Functional Dependency Constraints (Q2817905) (← links)
• (Q3341951) (← links)
• Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation (Q3508578) (← links)
• Join on Closure Systems Using Direct Implicational Basis Representation (Q3627735) (← links)
• (Q3715147) (← links)
• Algorithms for inferring functional dependencies from relations (Q4294515) (← links)
• Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
• (Q4864789) (← links)
• (Q4955319) (← links)
• Technical Correspondence (Q5012536) (← links)
• (Q5310889) (← links)
• Normal forms and syntactic completeness proofs for functional independencies (Q5958763) (← links)