Results 211 to 220 of about 8,099 (222)
Some of the next articles are maybe not open access.
On Erdős' extremal problem on matchings in hypergraphs
Journal of Combinatorial Theory - Series A, 2014Tomasz Łuczak
exaly
Reports Math. Log., 1991
Summary: A notion of satisfiability is defined for collections of vertex sets of a hypergraph and a method for determining satisfiability, called resolution, is introduced. An important special case is the resolution technique for determining satisfiability of a set of clauses in propositional logic.
openaire +2 more sources
Summary: A notion of satisfiability is defined for collections of vertex sets of a hypergraph and a method for determining satisfiability, called resolution, is introduced. An important special case is the resolution technique for determining satisfiability of a set of clauses in propositional logic.
openaire +2 more sources
Approximate counting of regular hypergraphs
Information Processing Letters, 2013Andrzej Dudek +2 more
exaly
Directed hypergraphs: Introduction and fundamental algorithms—A survey
Theoretical Computer Science, 2017Giorgio Ausiello, Luigi Laura
exaly
A new decision-making method based on bipolar neutrosophic directed hypergraphs
Journal of Applied Mathematics and Computing, 2017Muhammad Akram +2 more
exaly
Colorings of b-simple hypergraphs
Electronic Notes in Discrete Mathematics, 2017Margarita Akhmejanova, Dmitry Shabanov
exaly