923 search results - page 93 / 185 » On a generalization of Stickelberger's Theorem |
182
click to vote
COCO
2009
Springer
16 years 29 days ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
163
click to vote
AAAI
1993
15 years 7 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
167
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
183
click to vote
DCG
2006
15 years 6 months ago
2006
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...
142
click to vote
BSL
2004
15 years 6 months ago
2004
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...