Pages that link to "Item:Q3738576"
From MaRDI portal
The following pages link to Minimal Representation of Directed Hypergraphs (Q3738576):
Displaying 46 items.
- Optimal covers in the relational database model (Q303689) (← links)
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- Hydras: complexity on general graphs and a subclass of trees (Q507535) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- On the complexity of strongly connected components in directed hypergraphs (Q517789) (← links)
- On-line algorithms for satisfiability problems with uncertainty (Q673379) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- On implicational bases of closure systems with unique critical sets. (Q741717) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- Amortized efficiency of a path retrieval data structure (Q1099629) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- A hypergraph model for constraint logic programming and applications to bus drivers' scheduling (Q1353919) (← links)
- Recognition of tractable DNFs representable by a constant number of intervals (Q1751204) (← links)
- Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
- Extension and equivalence problems for clause minimal formulae (Q1777408) (← links)
- Directed hypergraphs and applications (Q1803674) (← links)
- Dynamic maintenance of the transitive closure in disjunctive graphs (Q1924722) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- Primitive tensors and directed hypergraphs (Q2261531) (← links)
- On the hydra number of disconnected graphs (Q2322888) (← links)
- Attribute-incremental construction of the canonical implication basis (Q2385433) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Directed hypergraphs and Horn minimization (Q2404615) (← links)
- Finding the \(K\) best policies in a finite-horizon Markov decision process (Q2433472) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- Unique key Horn functions (Q2672584) (← links)
- (Q5076579) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory (Q5445294) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- The complexity of arc-colorings for directed hypergraphs (Q5899364) (← links)
- The complexity of arc-colorings for directed hypergraphs (Q5917590) (← links)
- Dynamic algorithms for classes of constraint satisfaction problems (Q5941281) (← links)
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)
