178 search results - page 19 / 36 » Boolean Algebras in Visser Algebras |
FCT
2009
Springer
15 years 4 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
FUIN
2010
14 years 8 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
CMG
1996
14 years 11 months ago
1996
Consider yourself faced with learning about a new system. You have lots of measurements available, but you really don't know which measurements affect the values of others. H...
IFIPTCS
2010
14 years 7 months ago
2010
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new cl...
75
Voted
ENTCS
2006
14 years 9 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...