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

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Computational complexity theory
• Mathematical logic
• Constraint programming
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability modulo theories
• Maximum satisfiability problem
• Local consistency

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

Source URL: eprint.iacr.org

• Algebra
• Abstract algebra
• Mathematics
• Commutative algebra
• Lattice-based cryptography
• Post-quantum cryptography
• Cryptography
• Field theory
• Ring learning with errors
• Ring learning with errors key exchange
• Ring learning with errors signature

raSAT: SMT for Polynomial Inequality To Van Khanh (UET/VNU-HN) Vu Xuan Tung, Mizuhito Ogawa (JAIST

Source URL: smt2014.it.uu.se

• Algebra
• Polynomial
• RASAT
• Inequality
• NP-complete problems

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

Source URL: perso.ens-lyon.fr

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

Source URL: precision.moscito.org

• Cryptography
• Mathematics
• Polynomials
• Multivariate cryptography
• Algebra
• Pseudorandom number generator
• Computer algebra
• Hidden Field Equations
• QUAD
• Field extension
• Cryptographically secure pseudorandom number generator
• Mersenne Twister

. (0000) “Polynomial functors from algebras over a set-operad and non-linear Mackey functors,” International Mathematics Research Notices, Vol. 0000, Article ID rnn000, 54 pages. doi:imrn/rnn000 Polynomial fu

Source URL: irma.math.unistra.fr

• Algebra
• Mathematics
• Category theory
• Functors
• Adjoint functors
• Equivalence
• Homological algebra
• Sheaf
• Operad theory
• Natural transformation
• Isomorphism of categories
• Additive category

A polynomial time algorithm for computing the HNF of a module over the integers of a number field Jean-François Biasse Claus Fieker

Source URL: www.lix.polytechnique.fr

Lecture 20, Tues April 4: Shor, Quantum Fourier Transform Last time we started in on Shor’s algorithm, a quantum algorithm that can factor ​N​ into ​p​×​q​ in polynomial time by reducing the problem to per

Source URL: www.scottaaronson.com

• Mathematical analysis
• Mathematics
• Mathematical logic
• Set theory
• Operator theory
• Code
• Inner model theory
• Partial differential equations
• Complex analysis
• Omega-regular language
• Differential forms on a Riemann surface

Fast Exhaustive Search for Polynomial Systems in F2 Charles Bouillaguet1, Hsieh-Chung Chen2 , Chen-Mou Cheng3 , Tung Chou3 , Ruben Niederhagen3,4, Adi Shamir1,5, and Bo-Yin Yang2 1 2

Source URL: precision.moscito.org

• Mathematics
• Algebra
• Abstract algebra
• Computer algebra
• Algebraic geometry
• Polynomials
• Equations
• Grbner basis
• Equation solving
• System of polynomial equations
• Factorization
• Resultant

QUADRATIC FUNCTORS ON POINTED CATEGORIES MANFRED HARTL & CHRISTINE VESPA Abstract. We study polynomial functors of degree 2, called quadratic, with values in the category of abelian groups Ab, and whose source category i

Source URL: irma.math.unistra.fr

• Mathematics
• Abstract algebra
• Algebra
• Functors
• Category theory
• Homological algebra
• Algebraic topology
• Adjoint functors
• Natural transformation
• Yoneda lemma
• Limit
• Universal property