1175 search results - page 70 / 235 » Abstract computability and algebraic specification |
123
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
156
click to vote
ISSAC
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
119
click to vote
CJ
2010
15 years 3 months ago
2010
Abstract. Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex a...
107
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this note we reinvestigate the task of computing creative telescoping relations in differential-difference operator algebras. Our approach is based on an ansatz that e...