Skip to search formSkip to main contentSkip to account menu

Boolean algebra

Known as: Boolean search, BooleanAlgebra, Boolean logic in computer science 
In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
A New Kind of ScienceAND gateAlgebraic normal formBinary data

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data
Cloud computing economically enables the paradigm of data service outsourcing. However, to protect data privacy, sensitive cloud… 
Highly Cited
2010
Highly Cited
2010
Thirty years of spatial econometrics
In this paper, I give a personal view on the development of the field of spatial econometrics during the past 30 years. I argue… 
Highly Cited
2007
Highly Cited
2007
Self-organized computation with unreliable, memristive nanodevices
Nanodevices have terrible properties for building Boolean logic systems: high defect rates, high variability, high death rates… 
Highly Cited
2004
Highly Cited
2004
Constructive and axiomatic approaches of fuzzy approximation operators
Highly Cited
2002
Highly Cited
2002
Short Single Axioms for Boolean Algebra
We present short single equational axioms for Boolean algebra in terms of disjunction and negation and in terms of the Sheffer… 
Highly Cited
2002
Highly Cited
2002
From Boolean to probabilistic Boolean networks as models of genetic regulatory networks
Mathematical and computational modeling of genetic regulatory networks promises to uncover the fundamental principles governing… 
Highly Cited
1991
Highly Cited
1991
A formal approach to the scheduling problem in high level synthesis
An integer linear programming (ILP) model for the scheduling problem in high-level synthesis is presented. In addition to time… 
Highly Cited
1989
Highly Cited
1989
NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations
The problem of encoding the states of a synchronous Finite State Machine (FSM), so that the area of a two-level implementation of… 
1981
1981
Recursive Boolean algebras with recursive atoms
A Boolean algebra (henceforth abbreviated B.A.) is said to be recursive if B is a recursive subset of the natural numbers N and… 
Highly Cited
1970
Highly Cited
1970
Hierarchies of Boolean algebras
A denumerable structure is said to be recursive iff its universe is a recursive subset of the natural numbers and its relations… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)