16666 search results - page 149 / 3334 » Descriptive and Computational Complexity |
177
click to vote
CADE
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
148
Voted
COSIT
2003
Springer
15 years 9 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
151
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
153
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
144
click to vote
ICCS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We propose an approach to many-valued contexts using formal descriptions instead of scaling. The underlying idea is the philosphical definition of a concept as a set of ...