Sciweavers

5356 search results - page 75 / 1072
» Adventures in time and space
Sort
View
ECCC
2008
107views more  ECCC 2008»
14 years 12 months ago
A Quantum Time-Space Lower Bound for the Counting Hierarchy
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
Dieter van Melkebeek, Thomas Watson
CC
2006
Springer
101views System Software» more  CC 2006»
14 years 12 months ago
Inductive Time-Space Lower Bounds for Sat and Related Problems
We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.
Ryan Williams
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 12 months ago
On Universally Decodable Matrices for Space-Time Coding
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
Pascal O. Vontobel, Ashwin Ganesan
CORR
2006
Springer
83views Education» more  CORR 2006»
14 years 12 months ago
Perfect Space Time Block Codes
Frédérique E. Oggier, Ghaya Rekaya-B...
IEICET
2008
64views more  IEICET 2008»
14 years 12 months ago
Gramian-Preserving Frequency Transformation for Linear Discrete-Time State-Space Systems
Shunsuke Koshita, Satoru Tanaka, Masahide Abe, Mas...