Sciweavers

256 search results - page 12 / 52
» Separation of NP-Completeness Notions
Sort
View
CCS
2005
ACM
14 years 4 months ago
On fairness in simulatability-based cryptographic systems
Simulatability constitutes the cryptographic notion of a secure refinement and has asserted its position as one of the fundamental concepts of modern cryptography. Although simula...
Michael Backes, Dennis Hofheinz, Jörn Mü...
OOIS
1997
Springer
14 years 2 months ago
Subject Composition by Roles
Subjects model di erent perspectives on a problem domain by collections of related class hierarchies. Subjects can be seen as the result of separate and possibly independent devel...
Bent Bruun Kristensen
DMTCS
2003
93views Mathematics» more  DMTCS 2003»
14 years 7 days ago
Two Philosophical Applications of Algorithmic Information Theory
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invent...
Gregory J. Chaitin
DCC
1998
IEEE
13 years 10 months ago
Quasideterminant Characterization of MDS Group Codes over Abelian Groups
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Sepa...
A. A. Zain, B. Sundar Rajan
ICASSP
2008
IEEE
14 years 5 months ago
Impact of mismatched statistics on correlated MIMO capacity
Many recent works that study the impact of spatial correlation on the performance of multi-input multi-output (MIMO) systems assume a separable (also known as the Kronecker) model...
Vasanthan Raghavan, Akbar M. Sayeed, Jayesh H. Kot...