9842 search results - page 45 / 1969 » The Complexity of the Matching-Cut Problem |
TOC
2008
13 years 7 months ago
2008
Abstract: Consider the following version of the Hamming distance problem for
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
COCOA
2011
Springer
12 years 7 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
PODS
1998
ACM
13 years 12 months ago
1998
ACM
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...