Sciweavers

71 search results - page 13 / 15
» Testing Boolean Function Isomorphism
Sort
View
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
15 years 2 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
ISLPED
1995
ACM
96views Hardware» more  ISLPED 1995»
15 years 1 months ago
Towards a high-level power estimation capability
We will present a power estimation technique for digital integrated circuits that operates at the register transfer level RTL. Such a high-level power estimation capability is r...
Farid N. Najm
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 8 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
FOCS
2010
IEEE
14 years 7 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
EOR
2011
140views more  EOR 2011»
14 years 4 months ago
Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
Stefan Bolus