Sciweavers

4 search results - page 1 / 1
» Primality and Identity Testing via Chinese Remaindering
Sort
View
COCO
2006
Springer
88views Algorithms» more  COCO 2006»
13 years 7 months ago
Polynomial Identity Testing for Depth 3 Circuits
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
Neeraj Kayal, Nitin Saxena
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 7 days ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 3 days ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke