707 search results - page 130 / 142 » The Nonhomomorphicity of Boolean Functions |
DAC
1994
ACM
13 years 12 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
VDA
2010
13 years 10 months ago
2010
This paper presents the concept of Monotone Boolean Function Visual Analytics (MBFVA) and its application to the medical domain. The medical application is concerned with discover...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
CLEF
2006
Springer
13 years 11 months ago
2006
Springer
This paper describes our participation in the GeoCLEF monolingual English task of the Cross Language Evaluation Forum 2006. The main objective of this study is to evaluate the retr...