8512 search results - page 265 / 1703 » Computing Theory With Relevance |
225
Voted
UMC
2000
15 years 9 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
181
click to vote
FSEN
2009
Springer
16 years 22 days ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
175
click to vote
LICS
2006
IEEE
16 years 5 days ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
179
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
170
Voted
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...