384 search results - page 11 / 77 » Equivalence Relations on Classes of Computable Structures |
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
ISB
2002
14 years 9 months ago
2002
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
113
Voted
LICS
2012
IEEE
12 years 12 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
117
Voted
ICLP
2003
Springer
15 years 2 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
ASIACRYPT
2003
Springer
15 years 2 months ago
2003
Springer
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a varian...