Sciweavers

707 search results - page 114 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
CF
2008
ACM
13 years 10 months ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman
ECCC
2010
80views more  ECCC 2010»
13 years 8 months ago
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
Thomas Watson
CAV
2010
Springer
251views Hardware» more  CAV 2010»
13 years 12 months ago
Automated Assume-Guarantee Reasoning through Implicit Learning
Abstract. We propose a purely implicit solution to the contextual assumption generation problem in assume-guarantee reasoning. Instead of improving the L∗ algorithm — a learnin...
Yu-Fang Chen, Edmund M. Clarke, Azadeh Farzan, Min...
COLT
2006
Springer
13 years 11 months ago
Active Sampling for Multiple Output Identification
We study functions with multiple output values, and use active sampling to identify an example for each of the possible output values. Our results for this setting include: (1) Eff...
Shai Fine, Yishay Mansour
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 9 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm