Sciweavers

30 search results - page 2 / 6
» coco 2008
Sort
View
COCO
2008
Springer
84views Algorithms» more  COCO 2008»
14 years 11 months ago
New Results on Noncommutative and Commutative Polynomial Identity Testing
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Sri...
COCO
2008
Springer
79views Algorithms» more  COCO 2008»
14 years 11 months ago
Randomised Individual Communication Complexity
Harry Buhrman, Michal Koucký, Nikolai K. Ve...
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
14 years 11 months ago
Using Entanglement in Quantum Multi-prover Interactive Proofs
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, ...
COCO
2008
Springer
95views Algorithms» more  COCO 2008»
14 years 11 months ago
Hardness Amplification within NP against Deterministic Algorithms
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant
Parikshit Gopalan, Venkatesan Guruswami
BIOSTEC
2008
155views Healthcare» more  BIOSTEC 2008»
14 years 11 months ago
Ontology Based Integration of Distributed and Heterogeneous Data Sources in ACGT
Luis Martín, Alberto Anguita, Victor Maojo,...