Search results for "polynomial"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
53	Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan 0001	New Results on Noncommutative and Commutative Polynomial Identity Testing.	CCC	2008	DBLP DOI BibTeX RDF	randomized, polynomial time, deterministic, polynomial identity testing
47	Mark Giesbrecht, Daniel S. Roche	On lacunary polynomial perfect powers.	ISSAC	2008	DBLP DOI BibTeX RDF	black box polynomial, lacunary polynomial, perfect power, sparse polynomial
47	Zeev Dvir, Amir Shpilka	Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits.	STOC	2005	DBLP DOI BibTeX RDF	depth 3 circuits, locally decodable codes, polynomial identity testing
47	Boaz Barak, Yehuda Lindell	Strict polynomial-time in simulation and extraction.	STOC	2002	DBLP DOI BibTeX RDF
44	Erich L. Kaltofen	Polynomial factorization: a success story.	ISSAC	2003	DBLP DOI BibTeX RDF	black box polynomial, randomized algorithm, polynomial factorization, lattice basis reduction, symbolic/numeric hybrid method, straight line program
43	László Babai, Lajos Rónyai	Computing Irreducible Representations of Finite Groups	FOCS	1989	DBLP DOI BibTeX RDF	deterministic polynomial time, matrices list, randomized polynomial time, Las Vegas polynomial time, generators set, bit complexity, inequivalent irreducible representations, multiplication table, polynomial-size description, absolutely irreducible constituents, polynomial-time algorithm, equivalence class, finite groups, complex numbers, exact computations, algebraic number fields
41	Omer Giménez, Petr Hlinený, Marc Noy	Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.	WG	2005	DBLP DOI BibTeX RDF	subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial
41	Rainer Schuler	A Note on Universal Distributions for Polynomial-Time Computable Distributions.	CCC	1997	DBLP DOI BibTeX RDF
40	Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan 0002, Dawn Wilkins	How Many Queries Are Needed to Learn?	J. ACM	1996	DBLP DOI BibTeX RDF	exact identification, polynomial-query learning, polynomial-time learning, proper learning, certificates, membership queries, equivalence queries, polynomial-time hierarchy
39	Noga Alon, Alan M. Frieze, Dominic Welsh	Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs	FOCS	1994	DBLP DOI BibTeX RDF	polynomial time randomised approximation schemes, dense graphs, Tutte-Grothendieck polynomial, combinatorial quantities, spanning forests, strongly connected orientations, k-colorings, reliability probability, P-hard, ferromagnetic Q-state Potts model, linear matroids, weight enumerator, linear codes, partition functions, Tutte polynomial
38	Zohar Shay Karnin, Amir Shpilka	Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In.	CCC	2008	DBLP DOI BibTeX RDF	PIT, depth-3, arithmetic circuit, deterministic, polynomial identity testing
38	Kazushige Terui	Light affine lambda calculus and polynomial time strong normalization.	Arch. Math. Log.	2007	DBLP DOI BibTeX RDF	Light logics, Lambda calculus, Polynomial time
38	Alin Bostan, Thomas Cluzeau, Bruno Salvy	Fast algorithms for polynomial solutions of linear differential equations.	ISSAC	2005	DBLP DOI BibTeX RDF	complexity, computer algebra, linear recurrences, linear differential equations, polynomial solutions
38	Chengjun Liu	Gabor-Based Kernel PCA with Fractional Power Polynomial Models for Face Recognition.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	fractional power polynomial models, Gabor wavelet representation, Gabor-based kernel PCA method, Face recognition, kernel Principal Component Analysis (PCA)
36	Peter Bürgisser, Felipe Cucker	Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem.	STOC	2010	DBLP DOI BibTeX RDF	approximate zero, polynomial equation solving, complexity, polynomial time, smoothed analysis, homotopy methods
36	Dorit Aharonov, Vaughan Jones, Zeph Landau	A polynomial quantum algorithm for approximating the Jones polynomial.	STOC	2006	DBLP DOI BibTeX RDF	Jones Polynomial, Temperley-Lieb, braids, unitary representation, algorithm, approximation, knots, quantum
36	Arfst Nickelsen, Till Tantau	Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions.	FCT	2001	DBLP DOI BibTeX RDF	polynomial time reductions, verboseness, p-selectivity, positive reductions, structural complexity, partial information
35	Michel Cosnard, Pierre Fraigniaud	Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	poles and zeros, distributed memorysystems, asynchronous polynomial root finding, iterative polynomial root finding, locally convergent, asynchronous methods, synchronous, convergence, polynomials, convergence of numerical methods, distributed memory multicomputer, hypercube multicomputer, polynomial zeros
35	Sung-Kwun Oh, James F. Peters, Witold Pedrycz, Tae-Chon Ahn	Genetically Optimized Rule-Based Fuzzy Polynomial Neural Networks: Synthesis of Computational Intelligence Technologies.	RSFDGrC	2003	DBLP DOI BibTeX RDF	Rule-base fuzzy polynomial neural networks(RFPNN), rule-based fuzzy neural networks(RFNN), polynomial neural networks(PNN), computational intelligence(CI), genetic algorithms(GAs), design methodology
35	Pascal Giorgi, Claude-Pierre Jeannerod, Gilles Villard	On the complexity of polynomial matrix computations.	ISSAC	2003	DBLP DOI BibTeX RDF	column reduced form, matrix gcd, matrix polynomial, minimal basis, polynomial matrix multiplication, determinant
35	Yuan Xu 0005	Polynomial interpolation in several variables, cubature formulae, and ideals[*]Supported by the National Science Foundation under Grant DMS-9802265.	Adv. Comput. Math.	2000	DBLP DOI BibTeX RDF	polynomial interpolation in several variables, 65D05, 41A63, orthogonal polynomials, variety, 41A05, 41A10, polynomial ideals, 13P10, cubature formulae
35	Valentine Kabanets, Russell Impagliazzo	Derandomizing polynomial identity tests means proving circuit lower bounds.	STOC	2003	DBLP DOI BibTeX RDF	BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing
35	Masayuki Noro, Kazuhiro Yokoyama	Yet another practical implementation of polynomial factorization over finite fields.	ISSAC	2002	DBLP DOI BibTeX RDF
35	Luc Longpré, Osamu Watanabe 0001	On Symmetry of Information and Polynomial Time Invertibility.	ISAAC	1992	DBLP DOI BibTeX RDF
35	Leonid Khachiyan, Lorant Porkolab	Computing Integral Points in Convex Semi-algebraic Sets.	FOCS	1997	DBLP DOI BibTeX RDF	convex semi-algebraic sets, polynomial inequalities, linear integer programming, semidefinite integer programming, integer programming, polynomial-time algorithm, polynomial-time solvability
34	Ran Raz	Tensor-rank and lower bounds for arithmetic formulas.	STOC	2010	DBLP DOI BibTeX RDF	homogenous circuits, multilinear circuits, tensor rank, lower bounds, arithmetic circuits
34	Ran Raz	Elusive functions and lower bounds for arithmetic circuits.	STOC	2008	DBLP DOI BibTeX RDF	bounded depth circuits, lower bounds, arithmetic circuits, circuit complexity
33	Sung-Kwun Oh, Witold Pedrycz	Genetically Optimized Self-organizing Neural Networks Based on Polynomial and Fuzzy Polynomial Neurons: Analysis and Design.	Engineering Evolutionary Intelligent Systems	2008	DBLP DOI BibTeX RDF
33	Petr Husek, Renata Pytelková	On Polynomial and Polynomial Matrix Interpolation.	International Conference on Computational Science (2)	2002	DBLP DOI BibTeX RDF
33	Alberto Bertoni, Paola Campadelli, Anna Morpurgo, Sandra Panizza	Polynomial Iniform Convergence and Polynomial-Sample Learnability.	COLT	1992	DBLP DOI BibTeX RDF
33	Hiroshi Sekigawa, Kiyoshi Shirayanagi	On the Location of Pseudozeros of a Complex Interval Polynomial.	Math. Comput. Sci.	2007	DBLP DOI BibTeX RDF	Interval polynomial, polynomial, convex set, zero
33	Jean-Guillaume Dumas, Clément Pernet, Zhendong Wan	Efficient computation of the characteristic polynomial.	ISSAC	2005	DBLP DOI BibTeX RDF	Keller-Gehrig, Magma, finite field, probabilistic algorithm, characteristic polynomial, integer, minimal polynomial
33	Arash Reyhani-Masoleh, M. Anwarul Hasan	On Low Complexity Bit Parallel Polynomial Basis Multipliers.	CHES	2003	DBLP DOI BibTeX RDF	Finite or Galois field, Mastrovito multiplier, pentanomial, trinomial and equally-spaced polynomial, polynomial basis
32	Jonathan Katz, Yehuda Lindell	Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.	J. Cryptol.	2008	DBLP DOI BibTeX RDF	Expected polynomial-time, Black-box simulation, Zero-knowledge, Secure multiparty computation
32	Arash Hariri, Arash Reyhani-Masoleh	Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields.	WAIFI	2008	DBLP DOI BibTeX RDF	Shifted polynomial basis, binary extension fields, digit-serial, multiplication
32	Masakazu Kojima, Masakazu Muramatsu	An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones.	Math. Program.	2007	DBLP DOI BibTeX RDF	Polynomial optimization problem, Symmetric cone, Euclidean Jordan algebra, Global optimization, Semidefinite program, Sum of squares, Conic program
32	Hiroshi Sekigawa, Kiyoshi Shirayanagi	Locating real multiple zeros of a real interval polynomial.	ISSAC	2006	DBLP DOI BibTeX RDF	interval polynomial, real multiple zero, convex set
32	Manh Thang Nguyen, Danny De Schreye	Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs.	ICLP	2005	DBLP DOI BibTeX RDF	polynomial interpretations, acceptability, Termination analysis
32	Roberto Barrio	A Unified Rounding Error Bound for Polynomial Evaluation.	Adv. Comput. Math.	2003	DBLP DOI BibTeX RDF	recurrence relations, polynomial evaluation, rounding errors
32	Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka	The Black-Box Query Complexity of Polynomial Summation.	Comput. Complex.	2009	DBLP DOI BibTeX RDF	Subject classification. 68Q05, 68Q17, 68Q25, 68Q15
32	Yaohui Li, Yong Feng, Jiwei Xue	An Improved Method for Computing Dixon Polynomial.	ICYCS	2008	DBLP DOI BibTeX RDF
32	Arthur D. Chtcherba, Deepak Kapur	Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system.	ISSAC	2004	DBLP DOI BibTeX RDF	dialytic method, dixon resultant formulation, support hull, support-hull interior point, sylvester-type matrices, support, resultant, variable ordering
32	Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi	Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials.	ISSAC	2006	DBLP DOI BibTeX RDF	approximate multiple root, approximate polynomial gcd, multivariate polynomial gcd, singular polynomial, linear constraint, symbolic/numeric hybrid method
32	Linda Alvord, Tama Traberman	When bears are blue and bulls are red.	APL	1999	DBLP DOI BibTeX RDF	APL
30	Hiroki Arimura, Takeaki Uno	An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Maximal motif, Data mining, Algorithm, Delay, Polynomial time, Pattern discovery, Enumeration, Motif, Sequence mining, Closed pattern, Closed itemset
30	Dorit Aharonov, Vaughan Jones, Zeph Landau	A Polynomial Quantum Algorithm for Approximating the Jones Polynomial.	Algorithmica	2009	DBLP DOI BibTeX RDF
30	Yoshio Okamoto, Takeaki Uno	A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization.	ISAAC	2007	DBLP DOI BibTeX RDF
30	Jianping Li 0007, Weidong Li 0002, Jianbo Li	Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision.	COCOA	2009	DBLP DOI BibTeX RDF	Scheduling, allocation, polynomial time approximation scheme, fully polynomial time approximation scheme, grade of service
30	Arne Storjohann, Gilles Villard	Computing the rank and a small nullspace basis of a polynomial matrix.	ISSAC	2005	DBLP DOI BibTeX RDF	matrix rank, minimal polynomial basis, nullspace basis, polynomial matrix, linear algebra
30	Joachim von zur Gathen, Igor E. Shparlinski	Polynomial interpolation from multiples.	SODA	2004	DBLP BibTeX RDF	black box polynomial, hidden polynomial, integer lattices, short vectors, approximate computation
30	Don Coppersmith	Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities.	J. Cryptol.	1997	DBLP DOI BibTeX RDF	RSA, RSA, Polynomial, Polynomial, Factoring, Factoring, Key words
30	Ching-Chih Han, Hung-Ying Tyan	A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm.	RTSS	1997	DBLP DOI BibTeX RDF	polynomial-time schedulability test, real-time fixed-priority scheduling algorithms, closed-form utilization, polynomial-time schedulability, processor scheduling, schedulability condition
30	Thomas E. Hull, Rudolf Mathon	The Mathematical Basis and a Prototype Implementation of a New Polynomial Rootfinder With Quadratic Convergence.	ACM Trans. Math. Softw.	1996	DBLP DOI BibTeX RDF	polynomial rootfinder, polynomial zerofinder, quadratic convergence
30	Ker-I Ko, Klaus Weihrauch	On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries.	CCC	1996	DBLP DOI BibTeX RDF	Lebesgue measure, two-dimensional region, polynomial-time computable boundary, interior region, polynomial-time computable, computational complexity, computability, computability, Turing machines
30	Zeljko Zilic, Zvonko G. Vranesic	Reed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation.	ISMVL	1995	DBLP DOI BibTeX RDF	Reed-Muller forms, sparse polynomial interpolation, MVL RM transforms, interpolation, multivalued logic, Reed-Muller codes, polynomial interpolation, incompletely specified functions, computationally efficient algorithm
30	S. Y. Ku, R. J. Adler	Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm.	Commun. ACM	1969	DBLP DOI BibTeX RDF	Bezout's determinant, Sylvester's determinant, g.c.d algorithm, multivariate polynomial equations, polynomial resultant, reduced p.r.s algorithm, resultant algorithm, Euclidean algorithm, elimination
30	Terence R. F. Nonweiler	Algorithms: Algorithm 326: Roots of low-order polynomial equations.	Commun. ACM	1968	DBLP DOI BibTeX RDF	biquadratic equation roots, cubic equation roots, polynomial equation roots, quadratic equation roots, rootfinders, polynomial zeros
30	Jinfeng Wang 0003, Kwong-Sak Leung, Kin-Hong Lee, Zhenyuan Wang	Polynomial Nonlinear Integrals.	ISNN (1)	2008	DBLP DOI BibTeX RDF	Nonlinear integrals, Polynomial nonlinear integrals, Classification, Projection
30	Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand	Computing machine-efficient polynomial approximations.	ACM Trans. Math. Softw.	2006	DBLP DOI BibTeX RDF	minimax approximation, linear programming, floating-point arithmetic, polytopes, Polynomial approximation, Chebyshev polynomials
30	Payman Mohassel, Matthew K. Franklin	Efficient Polynomial Operations in the Shared-Coefficients Setting.	Public Key Cryptography	2006	DBLP DOI BibTeX RDF	polynomial operations, threshold homomorphic encryption, privacy-preserving set operations, secure multi-party computation, passive adversary
30	Evelyne Contejean, Claude Marché, Ana Paula Tomás, Xavier Urbain	Mechanically Proving Termination Using Polynomial Interpretations.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	polynomial interpretations, termination, term rewriting
30	Kurt Jetter, Georg Zimmermann	Polynomial Reproduction in Subdivision.	Adv. Comput. Math.	2004	DBLP DOI BibTeX RDF	vector subdivision, polynomial reproduction
30	Huapeng Wu	Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	hardware architecture, Finite fields arithmetic, polynomial basis
30	Ligang Liu, Guojin Wang	Recursive Formulae for Hermite Polynomial Approximations to Rational Bézier Curves.	GMP	2000	DBLP DOI BibTeX RDF	Rational Bézier curve, hybrid curve, Hermite curve, polynomial approximation
30	Ilya Averbouch, Benny Godlin, Johann A. Makowsky	A Most General Edge Elimination Polynomial.	WG	2008	DBLP DOI BibTeX RDF
30	Helmut Seidl, Andrea Flexeder, Michael Petter	Analysing All Polynomial Equations in .	SAS	2008	DBLP DOI BibTeX RDF
30	Amir Shpilka, Ilya Volkovich	Read-once polynomial identity testing.	STOC	2008	DBLP DOI BibTeX RDF	bounded depth circuits, identity testing, read-once formulas, reconstruction, arithmetic circuits
29	Josep M. Brunat, Antonio Montes	The characteristic ideal of a finite, connected, regular graph.	ISSAC	2004	DBLP DOI BibTeX RDF	characteristic ideal, galois graph, polynomial digraph, polynomial graph, strongly polynomial graph, variety of a pairing, pairing, connected component, conjecture
29	Hiroki Arimura, Takeaki Uno, Shinichi Shimozono	Time and Space Efficient Discovery of Maximal Geometric Graphs.	Discovery Science	2007	DBLP DOI BibTeX RDF	closed graph mining, rightmost expansion, polynomial delay polynomial space enumeration algorithms, depth-first search, geometric graphs
29	Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe	Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations.	CASES	2004	DBLP DOI BibTeX RDF	Barvinok's decomposition, Ehrhart polynomial, parametric polytope, quasi-polynomial, signed unimodular decomposition, polyhedral model, compiler analysis
29	Victor Y. Pan	Univariate polynomials: nearly optimal algorithms for factorization and rootfinding.	ISSAC	2001	DBLP DOI BibTeX RDF	Graeffe's lifting, Padé approximation, geometry of polynomial zeros, numerical polynomial factorization, rootfinding, univariate polynomials, computational complexity
29	Zhibin Lei, Daniel Keren, David B. Cooper	Computationally fast Bayesian recognition of complex objects based on mutual algebraic invariants.	ICIP	1995	DBLP DOI BibTeX RDF	computationally fast Bayesian recognition, complex objects recognition, 2D curve, 3D surface objects, Euclidean invariants, polynomial coefficients, Bayesian object recognition, robust recognition, mutual invariants recognizers, self invariants, object geometry, low computational cost, partially occluded articulated objects, joint geometry, self geometry, mutual algebraic invariants, database, computational geometry, object recognition, noise, polynomials, polynomial, vector, position, Bayes methods, patches, affine invariants
29	Marc Moreno Maza, Yuzhen Xie	An implementation report for parallel triangular decompositions.	SPAA	2006	DBLP DOI BibTeX RDF	polynomial system solver, parallel execution
29	Thomas Eiter, Kazuhisa Makino	Generating All Abductive Explanations for Queries on Propositional Horn Theories.	CSL	2003	DBLP DOI BibTeX RDF	Horn theories, polynomial total time computation, NP-hardness, abduction, propositional logic, Computational logic
28	Sung-Kwun Oh, Hyun-Ki Kim	Genetically Optimized Hybrid Fuzzy Polynomial Neural Networks Based on Polynomial and Fuzzy Polynomial Neurons.	Australian Conference on Artificial Intelligence	2005	DBLP DOI BibTeX RDF
28	Michael V. Basin, Peng Shi 0001, Darío Calderon-Alvarez	Optimal filtering for polynomial states over polynomial observations.	CDC	2008	DBLP DOI BibTeX RDF
27	Xumin Liu, Weixiang Xu, Yong Guan, Yuanyuan Shang	Trigonometric polynomial uniform B-spline surface with shape parameter.	ICIS	2009	DBLP DOI BibTeX RDF	trigonometric polynomial uniform B-spline with shape parameters, uniform trigonometric polynomial B-spline, C++, computer graphics, surface modeling, computer aided geometric design
27	Jaewook Chung, M. Anwar Hasan	Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers.	IEEE Symposium on Computer Arithmetic	2007	DBLP DOI BibTeX RDF	More generalized Mersenne numbers, Low-weight polynomial form integers, adapted modular number system, polynomial modular number system, Montgomery reduction algorithm
27	Haining Fan, M. Anwar Hasan	Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	Montgomery multiplication algorithm, shifted polynomial basis, Finite field, multiplication, polynomial basis, irreducible trinomial
27	Joseph M. Francos, Benjamin Friedlander	The polynomial phase difference operator for modeling of nonhomogeneous images.	ICIP	1995	DBLP DOI BibTeX RDF	polynomial phase difference operator, nonhomogeneous images, 2D signals, constant modulus polynomial-phase model, parameter estimation algorithm, phase differencing operator, modelling, modeling, image processing, parameter estimation, polynomials
27	Michel Cosnard, Pierre Fraigniaud	A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial.	CONPAR	1990	DBLP DOI BibTeX RDF	local memory parallel computers, simultaneous polynomial root-finders, Parallel algorithms, broadcasting, polynomial zeros
27	Guojun Li, Xiaotie Deng, Ying Xu 0001	A polynomial-time approximation scheme for embedding hypergraph in a cycle.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Hypergraph embedding, minimum congestion, NP-hard, polynomial-time approximation scheme
27	Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric Rodríguez-Carbonell, Albert Rubio	Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic.	CADE	2009	DBLP DOI BibTeX RDF	polynomial constraints, SAT modulo theories, program analysis, termination, Constraint solving
27	Omid Sarbishei, Bijan Alizadeh, Masahiro Fujita	Polynomial datapath optimization using partitioning and compensation heuristics.	DAC	2009	DBLP DOI BibTeX RDF	modular HED, polynomial datapath, high-level synthesis
27	Martin Mevissen, Kosuke Yokoyama, Nobuki Takayama	Solutions of polynomial systems derived from the steady cavity flow problem.	ISSAC	2009	DBLP DOI BibTeX RDF	finite difference discretization, polynomial optimization, semidefinite programming relaxation, steady cavity flow problem, sparsity
27	Daniel Andres, Viktor Levandovskyy, Jorge Martín-Morales	Principal intersection and bernstein-sato polynomial of an affine variety.	ISSAC	2009	DBLP DOI BibTeX RDF	bernstein-sato polynomial of variety, initial ideal, intersection with subalgebra, non-commutative gr?bner bases, preimage of ideal, annihilator, d-modules
27	Changbo Chen, Marc Moreno Maza, Wei Pan 0001, Yuzhen Xie	On the verification of polynomial system solvers.	Frontiers Comput. Sci. China	2008	DBLP DOI BibTeX RDF	polynomial system solver, software verification, triangular decomposition
27	Christophe Roland, R. Varadhan, C. E. Frangakis	Squared polynomial extrapolation methods with cycling: an application to the positron emission tomography problem.	Numer. Algorithms	2007	DBLP DOI BibTeX RDF	Fixed-point methods, Polynomial extrapolation methods, Nonlinear systems, Linear systems, Squaring
27	Jin-Song Wang, Wen-Feng Qi 0001	Linear Equation on Polynomial Single Cycle T-Functions.	Inscrypt	2007	DBLP DOI BibTeX RDF	single cycle, pseudorandom generator, polynomial function
27	Cheng-Hsiung Hsieh, Ren-Hsien Huang, Ting-Yu Feng	One-Dimensional Grey Polynomial Interpolators for Image Enlargement.	ACIS-ICIS	2007	DBLP DOI BibTeX RDF	Grey First Order Accumulated Generating Operation, Image Enlargement, Polynomial Interpolation
27	Sergey P. Tarasov, Mikhail N. Vyalyi	An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity.	CSR	2007	DBLP DOI BibTeX RDF	algorithm, sparse representation, root of unity, cyclotomic polynomial
27	Yufu Chen, Xiaohui Meng	Border bases of positive dimensional polynomial ideals.	SNC	2007	DBLP DOI BibTeX RDF	border basis, algorithm, polynomial ideal
27	Byoung-Jun Park, Witold Pedrycz, Sung-Kwun Oh	Fuzzy polynomial neurons as neurofuzzy processing units.	Neural Comput. Appl.	2006	DBLP DOI BibTeX RDF	Fuzzy polynomial neuron, Functional neuron, Neurofuzzy computing architecture, Universal approximator
27	Selçuk Baktir, Berk Sunar	Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF	fermat numbers, fermat transform, Fast Fourier Transform (FFT), finite fields, elliptic curve cryptography, coding theory, polynomial multiplication
27	Debojyoti Bhattacharya, Debdeep Mukhopadhyay, Dipanwita Roy Chowdhury	A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation.	ACRI	2006	DBLP DOI BibTeX RDF	MPSK Modulation, RS-encoding, Cellular Automata, Galois field, Primitive polynomial
27	David Castro 0007, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo	The Hardness of Polynomial Equation Solving.	Found. Comput. Math.	2003	DBLP DOI BibTeX RDF	Polynomial equation solving, Continuous data structure, Holomorphic and continuous encoding, Complexity, Elimination theory
27	John H. Reif	Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix.	Algorithmica	2001	DBLP DOI BibTeX RDF	Nested Dissection, Parallel algorithms, Characteristic polynomial, Sparse linear systems
27	Satoru Iwata 0001, Lisa Fleischer, Satoru Fujishige	A combinatorial strongly polynomial algorithm for minimizing submodular functions.	J. ACM	2001	DBLP DOI BibTeX RDF	Discrete optimization, submodular function, strongly polynomial algorithm
27	Alexander A. Razborov	Lower Bounds for the Polynomial Calculus.	Comput. Complex.	1998	DBLP DOI BibTeX RDF	polynomial calculus, Proof complexity, pigeonhole principle
27	Peter Bürgisser, Martin Lotz	The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties.	Found. Comput. Math.	2007	DBLP DOI BibTeX RDF