26 search results - page 6 / 6 » MTL with Bounded Variability: Decidability and Complexity |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...