FCT
2003
Springer
13 years 9 months ago
2003
Springer
FCT
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
FCT
2003
Springer
13 years 9 months ago
2003
Springer
FCT
2003
Springer
13 years 9 months ago
2003
Springer
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
FCT
2003
Springer
13 years 9 months ago
2003
Springer
: In this paper a comparison is provided between the membrane computing systems and the graphical interfaces of operating systems. A membrane computing system is a computing model ...
FCT
2003
Springer
13 years 9 months ago
2003
Springer
FCT
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
FCT
2003
Springer
13 years 9 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
FCT
2003
Springer
13 years 9 months ago
2003
Springer
This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms s...
FCT
2003
Springer
13 years 9 months ago
2003
Springer
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...