923 search results - page 99 / 185 » On a generalization of Stickelberger's Theorem |
171
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
174
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
208
click to vote
LION
2009
Springer
16 years 27 days ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
210
click to vote
ACL2
2006
ACM
16 years 10 days ago
2006
ACM
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...
145
click to vote
CSFW
2005
IEEE
15 years 12 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...