Navegar

Colección

Datos Estadísticas

Lista de

Computational complexity
9
"A polyhedral study of the maximum edge subgraph problem" (2012) Bonomo, F.; Marenco, J.; Saban, D.; Stier-Moses, N.E. Discrete Applied Mathematics. 160(18):2573-2590
"Real roots of univariate polynomials and straight line programs" (2007) Perrucci, D.; Sabia, J. Journal of Discrete Algorithms. 5(3):471-478
"Algorithms for clique-independent sets on subclasses of circular-arc graphs" (2006) Durán, G.; Lin, M.C.; Mera, S.; Szwarcfiter, J.L. Discrete Applied Mathematics. 154(13 SPEC ISS):1783-1790
"On the complexity of the resolvent representation of some prime differential ideals" (2006) D'Alfonso, L.; Jeronimo, G.; Solernó, P. Journal of Complexity. 22(3):396-430
"NP-completeness results for edge modification problems" (2006) Burzyn, P.; Bonomo, F.; Durán, G. Discrete Applied Mathematics. 154(13 SPEC ISS):1824-1844
"NP-completeness results for edge modification problems" (2006) Burzyn, P.; Bonomo, F.; Durán, G. Discrete Applied Mathematics. 154(13 SPEC ISS):1824-1844
"Lowness properties and approximations of the jump" (2006) Figueira, S.; Nies, A.; Stephan, F. Electronic Notes in Theoretical Computer Science. 143(SPEC ISS):45-57
"Generalized polar varieties: Geometry and algorithms" (2005) Bank, B.; Giusti, M.; Heintz, J.; Pardo, L.M. Festschrift for the 70th Birthday of Arnold Schonhage. 21(4):377-412
"Numeric vs. symbolic homotopy algorithms in polynomial system solving: A case study" (2005) De Leo, M.; Dratman, E.; Matera, G. Festschrift for the 70th Birthday of Arnold Schonhage. 21(4):502-531