MenuAlgebra and Combinatorics Seminar
Date: March 3, 2017
Time: 3:00PM - 3:50PM
Location: BLOC 628
Speaker: Yuyu Zhu, Texas A&M University
Title: A Fast Algoritm for Complex Feasibility
Abstract: Complex feasibility is the problem of deciding if a system of polynomials with integer coefficients has a complex solution. Koiran proved that under the assumption of generalized Riemann Hypothesis, this problem is in the polynomial hierarchy. We will talk about a fast algorithm to determine the satisfiability of the system based on this result. We will also look for weaker assumptions aided with results and conjectures on prime density.
