Sciweavers

1368 search results - page 222 / 274
» Generalized Rook Polynomials
Sort
View
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
15 years 5 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
JAIR
1998
81views more  JAIR 1998»
15 years 5 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström
MST
1998
76views more  MST 1998»
15 years 5 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
JCB
2008
111views more  JCB 2008»
15 years 5 months ago
Sorting Genomes with Centromeres by Translocations
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromer...
Michal Ozery-Flato, Ron Shamir
JACM
2010
116views more  JACM 2010»
15 years 4 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára