29908 search results - page 262 / 5982 » On the Complexity of |
160
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
162
click to vote
ARITH
2003
IEEE
15 years 12 months ago
2003
IEEE
Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a comp...
172
click to vote
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
A skew angle estimation approach based on the application of a fuzzy directional runlength is proposed for complex address images. The proposed technique was tested on a variety o...
171
click to vote
CICLING
2003
Springer
15 years 12 months ago
2003
Springer
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
163
Voted
COCOON
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...