搜索结果: 1-1 共查到“计算数学 NON-SINGULAR MATRIX”相关记录1条 . 查询时间(0.078 秒)
WEAKENING ASSUMPTIONS FOR DETERMINISTIC SUBEXPONENTIAL TIME NON-SINGULAR MATRIX COMPLETION
WEAKENING ASSUMPTIONS DETERMINISTIC NON-SINGULAR MATRIX
2012/11/30
Kabanets and Impagliazzo [9] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial f...