6833 search results - page 346 / 1367 » Some two-character sets |
171
click to vote
ECCC
2002
15 years 6 months ago
2002
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
162
Voted
DCG
1999
15 years 6 months ago
1999
A spherical -design on Sn-1 is a finite set such that, for all polynomials f of degree at most , the average of f over the set is equal to the average of f over the sphere Sn-1 . ...
155
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
143
click to vote
TCOM
2010
15 years 5 months ago
2010
—In this paper we analyze an adaptive downstream multichannel VDSL precoder that is based on error signal feedback. The analysis presents sufficient conditions for precoder conv...
193
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new cl...