Oscillatory Integrals with Polynomial Phase By Ioannis Parissis

Source URL: www.math.ist.utl.pt

Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels Dániel Marx1 Bart M.P. Jansen2

Source URL: www.cs.bme.hu

Polynomial Speed-Up Quantum Algorithms OV E RV I E W Frédéric Magniez CNRS, Univ Paris Diderot Limoges 2013

Source URL: pqcrypto2013.xlim.fr

The Polynomial method: Problem Set 1 Due noon, Tuesday , April 28th This assignment is based on chapters 1–3, and you may use any material that was studied in these chapters to solve the questions in it.

Source URL: www.math.caltech.edu

Looking beyond XTR Wieb Bosma1 , James Hutton2 , and Eric R. Verheul3 1 Mathematisch Instituut, Universiteit Nijmegen, Postbus 9010, 6500 GL Nijmegen, The Netherlands,

Source URL: www.math.ru.nl

• Polynomials
• Algebra
• Field theory
• XTR
• Cyclotomic polynomial
• Minimal polynomial
• Field extension
• Elementary symmetric polynomial
• Elliptic curve
• Irreducible polynomial
• Permutation polynomial

Chapter 4: Constant-degree Polynomial Partitioning Adam Sheffer May 1, 2015 In this chapter we present a different way of deriving incidence bounds by using polynomial partitioning. This method yields slightly worse boun

Source URL: www.math.caltech.edu

Search Techniques for Rational Polynomial Orders? Carsten Fuhs1 , Rafael Navarro-Marset2, Carsten Otto1 , J¨ urgen Giesl1 , 2 1

Source URL: verify.rwth-aachen.de

On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy

Source URL: www.theoryofcomputing.org

Optimization over Polynomials: Selected Topics Monique Laurent Abstract. Minimizing a polynomial function over a region defined by polynomial inequalities models broad classes of hard problems from combinatorics, geometr

Source URL: homepages.cwi.nl

Search Techniques for Rational Polynomial Orders? Carsten Fuhs1 , Rafael Navarro-Marset2, Carsten Otto1 , J¨ urgen Giesl1 , 2 1

Source URL: verify.rwth-aachen.de