Sciweavers

612 search results - page 4 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
IJCINI
2007
113views more  IJCINI 2007»
14 years 11 months ago
Toward Theoretical Foundations of Autonomic Computing
Autonomic computing (AC) is an intelligent computing approach that autonomously carries out robotic and interactive applications based on goal- and inference-driven mechanisms. Th...
Yingxu Wang
STACS
2010
Springer
15 years 6 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen
58
Voted
FOCS
2008
IEEE
15 years 6 months ago
Entangled Games are Hard to Approximate
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, ...
77
Voted
FOCS
1990
IEEE
15 years 3 months ago
Security Preserving Amplification of Hardness
Oded Goldreich, Russell Impagliazzo, Leonid A. Lev...