7106 search results - page 120 / 1422 » Restricted Complexity, General Complexity |
113
click to vote
CSL
2010
Springer
15 years 3 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
113
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
— For an nt transmit, nr receive antenna system (nt × nr system), a full-rate space time block code (STBC) transmits nmin = min(nt, nr) complex symbols per channel use and in ge...
143
Voted
JACM
2010
15 years 1 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
186
click to vote
CC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
129
click to vote
CASES
2009
ACM
15 years 1 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...