Pages that link to "Item:Q1202891"
From MaRDI portal
The following pages link to On the complexity of inferring functional dependencies (Q1202891):
Displayed 16 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)
- 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)
- A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis (Q1870542) (← links)
- Reducing one class of machine learning algorithms to logical operations of plausible reasoning (Q2017512) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- Functional and multivalued dependencies in nested databases generated by record and list constructor (Q2502161) (← links)
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation (Q3508578) (← links)
- Join on Closure Systems Using Direct Implicational Basis Representation (Q3627735) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- Normal forms and syntactic completeness proofs for functional independencies (Q5958763) (← links)