9842 search results - page 220 / 1969 » The Complexity of the Matching-Cut Problem |
AISC
2000
Springer
14 years 3 months ago
2000
Springer
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make “howlers” or not to simplify enough. In thi...
SAT
2004
Springer
14 years 4 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
CIE
2009
Springer
14 years 5 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
ISCAS
2002
IEEE
14 years 3 months ago
2002
IEEE
The problem of a useful electrical power quantification in environments with power quality problems is discussed. As it is difficult to correctly apply a Fourier-based approach, a...
CSL
2004
Springer
14 years 4 months ago
2004
Springer
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...