Search Sciweavers | Sciweavers

24421 search results - page 42 / 4885

» Communicating Complex Systems

click to vote

CIE
2008
Springer

91views Applied Computing» more CIE 2008»

Succinct NP Proofs from an Extractability Assumption

15 years 5 months ago

Download research.cyber.ee

Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...

Giovanni Di Crescenzo, Helger Lipmaa

claim paper

Read More »

click to vote

COMPLEXITY
2008

73views more COMPLEXITY 2008»

"Homeopathic" dynamical systems

15 years 3 months ago

Download server10.how-why.com

Alfred W. Hübler

claim paper

Read More »

Voted

AICT
2008
IEEE

103views Communications» more AICT 2008»

BER and Complexity Comparisons of the MPIC Receiver and the Linear Chip Equalizer

15 years 9 months ago

Download www.supcom.mincom.tn

Ayari Aymen, Hatem Boujemaa, Mohamed Siala

claim paper

Read More »

click to vote

ICC
2008
IEEE

134views Communications» more ICC 2008»

Low-Complexity Factor Graph Receivers for Spectrally Efficient MIMO-IDMA

15 years 9 months ago

Download publik.tuwien.ac.at

Clemens Novak, Franz Hlawatsch, Gerald Matz

claim paper

Read More »

114

click to vote

GLOBECOM
2010
IEEE

101views Communications» more GLOBECOM 2010»

Optimality Properties and Low-Complexity Solutions to Coordinated Multicell Transmission

15 years 1 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers