Sciweavers

1132 search results - page 73 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
STOC
1999
ACM
85views Algorithms» more  STOC 1999»
15 years 10 months ago
A Theorem on Sensitivity and Applications in Private Computation
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
Anna Gál, Adi Rosén
CORR
2007
Springer
141views Education» more  CORR 2007»
15 years 6 months ago
Joint Source-Channel Codes for MIMO Block Fading Channels
—We consider transmission of a continuous amplitude source over an L-block Rayleigh-fading Mt 2 Mr multiple-input multiple-output (MIMO) channel when the channel state informatio...
Deniz Gündüz, Elza Erkip
MFCS
2010
Springer
15 years 4 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
COCOA
2010
Springer
15 years 4 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad
CADE
2005
Springer
16 years 6 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard