923 search results - page 81 / 185 » On a generalization of Stickelberger's Theorem |
159
click to vote
FROCOS
2005
Springer
15 years 11 months ago
2005
Springer
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
166
click to vote
JCT
2002
15 years 6 months ago
2002
In [1], the author generalized Ehrhart's idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vert...
223
click to vote
TIT
2010
15 years 1 months ago
2010
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
160
click to vote
ICALP
2007
Springer
16 years 13 days ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
172
click to vote
ICAIL
2003
ACM
15 years 11 months ago
2003
ACM
This paper proposes a logic-oriented framework for institutional agents specification and analysis. Within this framework institutional agents are seen as artificial agents that a...