Binary Relations, Algebras, Games R Hirsch, I Hodkinson, M Jackson, S Mikulas and others March 11, 2015 1

Source URL: www-users.york.ac.uk

• Algebra
• Mathematics
• Abstract algebra
• Algebraic logic
• Algebraic structures
• Boolean algebra
• Mathematical logic
• Semigroup theory
• Relation algebra
• Monoid
• Residuated Boolean algebra
• Heyting algebra

1 Minimizing Deterministic Lattice Automata SHULAMIT HALAMISH, The Hebrew University ORNA KUPFERMAN, The Hebrew University Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weigh

Source URL: tocl.acm.org

Minimal Sets over Monotone Predicates in Boolean Formulae Joao Marques-Silva1,2 , Mikol´aˇs Janota2 , and Anton Belov1? 1 2

Source URL: anton.belov-mcdowell.com

Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates P´eter G´acs ∗ Department of Computer Science Boston University Boston, MA 02215

Source URL: www.cs.bu.edu

Crossed Exponentially Tapered Slots Antenna (XETS) - CAD Model Import and Simulation By using only one boolean union operation, we turn the whole model into a single body ready for material assignment and meshing. In fac

Source URL: www.wipl-d.jp

PDF Document

Source URL: www.kestrel.edu

• Mathematics
• Algebra
• Abstract algebra
• Boolean algebra
• Algebraic structures
• Constraint programming
• Electronic design automation
• Formal methods
• Boolean satisfiability problem
• DPLL algorithm
• Conjunctive normal form
• Propositional calculus

PDF Document

Source URL: www-users.york.ac.uk

• Algebra
• Mathematics
• Abstract algebra
• Semigroup theory
• Algebraic structures
• Monoid
• Semigroup
• Inverse element
• Commutative property
• Inverse semigroup
• Boolean algebra
• Quantale

Boolean Functions for Pair Sharing Analysis Lunjin Lu and Xuan Li Oakland University Rochester, MI 48309, USA {l2lu,x2li}@oakland.edu

Source URL: www.secs.oakland.edu

Generating High-Quality Tests for Boolean Circuits by Treating Tests as Proof Encoding? Eugene Goldberg and Panagiotis Manolios Northeastern University, USA {eigold,pete}@ccs.neu.edu Abstract. We consider the problem of

Source URL: eigold.tripod.com

EXTENSIONAL UNIFORMITY FOR BOOLEAN CIRCUITS† PIERRE MCKENZIE‡ , MICHAEL THOMAS§ , AND HERIBERT VOLLMER§ Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simpl

Source URL: www.thi.uni-hannover.de