Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

The Lovász Local Lemma [5] (LLL) is a powerful result in probability theory that states that the probability that none of a set… Expand

2007

2007

We construct a new family, indexed by the odd integers $N\geq 1$, of $(2+1)$-dimensional quantum field theories called {\it… Expand

Highly Cited

2005

Highly Cited

2005

Through their use of weblogs, teenage girls are bridging their offline and online relationships. As the girls use this medium to… Expand

2001

2001

We introduce a new way to measure the space needed in resolution refutations of CNF formulas in propositional logic. With the… Expand

2001

2001

Abstract Firstly, in this paper, we prove that the equivalence of simplicity and the symmetry of forking. Secondly, we attempt to… Expand

Highly Cited

1997

Highly Cited

1997

Prepositional logic formulas containing implications can suffer from antecedent failure, in which the formula is true trivially… Expand

1996

1996

We present formulas of Rodrigues type giving the Macdonald polynomials for arbitrary partitionsλthrough the repeated application… Expand

1993

1993

Abstract Recent studies in semantics of modal and superintuitionistic predicate logics provided many examples of incompleteness… Expand

1993

1993

A number of efficient learning algorithms achieve exact identification of an unknown function from some class using membership… Expand

Highly Cited

1991

Highly Cited

1991

Deformed orthogonal and pseudo-orthogonal Lie algebras are constructed which differ from deformations of Lie algebras in terms of… Expand