Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases David Rolnick

First Page		Document Content
Date: 2015-08-17 07:00:17 Mathematics Algebra Graph coloring Abstract algebra Computer algebra Algebraic geometry Commutative algebra Grbner basis Invariant theory Monomial order Polynomial		Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases David Rolnick Add to Reading List Source URL: www.issac-symposium.org Download Document from Source Website File Size: 411,24 KB Share Document on Facebook

	Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions⋆ Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain DocID: 1xVFd - View Document
	On the Ring-LWE and Polynomial-LWE Problems Miruna Rosca1,2 , Damien Stehlé1 , and Alexandre Wallet1 1 ENS de Lyon, Laboratoire LIP (U. Lyon, CNRS, ENSL, INRIA, UCBL), France DocID: 1xVxG - View Document
	raSAT: SMT for Polynomial Inequality To Van Khanh (UET/VNU-HN) Vu Xuan Tung, Mizuhito Ogawa (JAIST DocID: 1xVsE - View Document
	Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume Dumas DocID: 1xUE0 - View Document
	Secure PRNGs from Specialized Polynomial Maps over Any Fq Feng-Hao Liu1 , Chi-Jen Lu2 , and Bo-Yin Yang2 1 Department of Computer Science, Brown University, Providence RI, USA DocID: 1xUwb - View Document