Sciweavers

235 search results - page 12 / 47
» Average-case complexity and decision problems in group theor...
Sort
View
STACS
2009
Springer
14 years 2 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
BIRTHDAY
2010
Springer
13 years 8 months ago
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
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...
Dexter Kozen
ISAMI
2010
13 years 5 months ago
A Data Mining Approach for the Detection of High-Risk Breast Cancer Groups
It is widely agreed that complex diseases are typically caused by the joint effects of multiple instead of a single genetic variation. These genetic variations may show very little...
Orlando Anunciação, Bruno C. Gomes, ...
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
14 years 2 months ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...
FCT
2007
Springer
14 years 1 months ago
The Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
Sebastian Dörn, Thomas Thierauf