Search Sciweavers | Sciweavers

612 search results - page 4 / 123

» Hardness assumptions in the foundations of theoretical compu...

click to vote

IJCINI
2007

113views more IJCINI 2007»

Toward Theoretical Foundations of Autonomic Computing

13 years 7 months ago

Download www2.enel.ucalgary.ca

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

claim paper

Read More »

click to vote

STACS
2010
Springer

168views Theoretical Computer Science» more STACS 2010»

Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion

14 years 2 months ago

Download itcs.tsinghua.edu.cn

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

claim paper

Read More »

click to vote

ICMT
2009
Springer

99views Theoretical Computer Science» more ICMT 2009»

Foundations for Bidirectional Programming

14 years 2 months ago

Download www.cis.upenn.edu

Benjamin C. Pierce

claim paper

Read More »