173 search results - page 17 / 35 » A Proof of the Two-path Conjecture |
98
Voted
DLOG
2009
14 years 9 months ago
2009
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
114
click to vote
EJC
2008
14 years 12 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
COCO
2009
Springer
15 years 6 months ago
2009
Springer
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...
ACS
2008
14 years 12 months ago
2008
We establish an algebra-isomorphism between the complexified Grothendieck ring F of certain bimodule categories over a modular tensor category and the endomorphism algebra of appr...
DM
2010
14 years 12 months ago
2010
We resolve affirmatively some conjectures of Reiner, Stanton, and White [6] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and co...