Counting solutions to binomial complete intersections

Mostrar todas las versiones(3)

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is finite. We give a combinatorial formula for computing the total n...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Cattani, E., Dickenstein, A.
Formato: Artículo publishedVersion
Publicado: 2007
Materias:
# P-complete
Binomial ideal
Complete intersection
Computational methods
Polynomials
Problem solving
Vectors
Binomials
Polynomial time
Algebra
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0885064X_v23_n1_p82_Cattani
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0885064X_v23_n1_p82_Cattani_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares