ISIT 2004, Chicago, USA, June 27 – July 2, 2004 On some properties of symmetric Boolean functions Marion Videau INRIA projet CODES, BP 105, 78153 Le Chesnay cedex, FRANCE

Source URL: videau.lecte.com

Analysis of Boolean Functions (CMU 18-859S, SpringLecture 4: Locally testing Dictatorship with NAE; explicit PCPPs Jan. 25, 2005

Source URL: www.cs.cmu.edu

Graph based Synthesis for Low power Combinational logic with a maximal/minimal disjoint Function Set ABSTRACT This paper discusses a new, systematic approach to the synthesis of a class of non-regenerative Boolean networ

Source URL: apt.cs.manchester.ac.uk

Programmatic and Direct Manipulation, Together at Last Ravi Chugh Brian Hempel Mitchell Spradlin

Source URL: arxiv.org

• Mathematics
• Algebraic logic
• Boolean algebra
• Function
• Equation solving
• Expected value
• Parameter
• Equation

Uniform Interpolation and Compact Congruences Samuel J. van Gool1 , George Metcalfe2 , and Constantine Tsinakis3 1 Department of Mathematics, University of Milan

Source URL: logica.dmi.unisa.it

• Algebra
• Mathematics
• Abstract algebra
• Algebraic logic
• Lattice theory
• Algebraic structures
• Fuzzy logic
• Adjoint functors
• Boolean algebra
• Heyting algebra
• Universal property
• MV-algebra

First-order satisfiability in Gödel logics: an NP-complete fragment Matthias Baaza,1 , Agata Ciabattonia,2 , Norbert Preininga,b,3 a b

Source URL: www.preining.info

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Non-classical logic
• Logic in computer science
• Predicate logic
• First-order logic
• Boolean satisfiability problem
• Gdel numbering
• Many-valued logic
• Kripke semantics

ISIT 2008, Toronto, Canada, July, 2008 Matriochka symmetric Boolean functions C´edric Lauradoux Marion Videau

Source URL: videau.lecte.com

LEARNING LARGE-ALPHABET AND ANALOG CIRCUITS WITH VALUE INJECTION QUERIES Dana Angluin1 James Aspnes1 Jiang Chen2

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Complexity classes
• Clique problem
• Boolean circuit
• ACC0
• Clique
• Circuit
• NC

The Complexity of Weighted Boolean #CSP Modulo k Heng Guo∗ Sangxia Huang†

Source URL: pages.cs.wisc.edu

Abstract interpretation of probabilistic semantics David Monniaux http://www.di.ens.fr/~monniaux LIENS, 45 rue d’UlmParis cedex 5, France

Source URL: www-verimag.imag.fr

• Theoretical computer science
• Mathematics
• Mathematical logic
• Logic in computer science
• Programming language semantics
• Measure theory
• Boolean algebra
• Probability theory
• Denotational semantics
• Predicate transformer semantics
• Sigma-algebra
• PP