1730 search results - page 105 / 346 » Algebra and Computation |
112
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
112
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
124
Voted
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
110
Voted
FUIN
2006
15 years 21 days ago
2006
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
112
Voted
ISOLA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Interface-based design relies on the idea that different components of a system may be developed independently and a system designer can connect them together only if th...