Home
Resource
Computational aspects of the Combinatorial Nullstellensatz method via a polynomial approach to matrix and hypermatrix algebra
PDF
PDF format is widely accepted and good for printing.
Plug-in required
PDF-1(394.89 kb)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Gnang, Edinah K.. Computational aspects of the Combinatorial Nullstellensatz method via a polynomial approach to matrix and hypermatrix algebra. Retrieved from https://doi.org/doi:10.7282/T3CJ8BHX

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleComputational aspects of the Combinatorial Nullstellensatz method via a polynomial approach to matrix and hypermatrix algebra
NameGnang, Edinah K. (author); Elgammal, Ahmed (chair); Retakh, Vladimir (co-chair); Szegedy, Mario (internal member); Sloane, Neil (outside member); Rutgers University; Graduate School - New Brunswick
Date Created2013
Other Date2013-10 (degree)
SubjectComputer Science, Combinatorial analysis, Matrices, Alon, Noga
Extentviii, 80 p. : ill.
DescriptionWe discuss a polynomial encoding which provides a unified framework for discussing the algebra and the spectral analysis of matrices and hypermatrices. In addition to describing some algorithms for performing orthogonalization and spectral analysis of hypermatrices, we discuss some computational aspects, more specifically the important role of symmetries in Alon’s Combinatorial Nullstellensatz method for solving combinatorial problems.
NotePh.D.
NoteIncludes bibliographical references
Noteby Edinah K. Gnang
Genretheses, ETD doctoral
Persistent URLhttps://doi.org/doi:10.7282/T3CJ8BHX
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024