Sciweavers

1650 search results - page 43 / 330
» The HOM problem is decidable
Sort
View
CC
2006
Springer
147views System Software» more  CC 2006»
13 years 7 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
CP
2009
Springer
14 years 8 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
LATA
2009
Springer
14 years 2 months ago
Decision Problems for Convex Languages
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu
CSO
2009
IEEE
14 years 2 months ago
Competitive Analysis of Online Price Discount Replacement Problem
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...
Lili Ding, Xinmin Liu, Wanglin Kang
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 1 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx