|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2667 occurrences of 1351 keywords
|
|
|
Results
Found 9920 publication records. Showing 9920 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
27 | Afaq Ahmad 0001, N. K. Nanda, K. Garg |
Are Primitive Polynomials Always Best in Signature Analysis? |
IEEE Des. Test Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima |
On Determining the Solvability of Polynomials. |
ISSAC |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Nicola Santoro, Stuart J. Sidney, Jorge Urrutia |
Geometric Containment, Common Roots of Polynomials and Partial Orders. |
STACS |
1988 |
DBLP DOI BibTeX RDF |
|
27 | Rüdiger Loos |
An Analysis of the Krönecker Algorithm for Factorization of Algebraic Polynomials. |
AAECC |
1985 |
DBLP DOI BibTeX RDF |
|
27 | Oscar Moreno de Ayala |
Discriminants and the irreducibility of a class of polynomials. |
AAECC |
1984 |
DBLP DOI BibTeX RDF |
|
26 | Ruymán Cruz-Barroso, Pablo González-Vera, Francisco Perdomo-Pío |
An application of Szego polynomials to the computation of certain weighted integrals on the real line. |
Numer. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Gaussian quadrature formulas, Szeg? polynomials, Szeg? quadrature formulas, Interpolatory type quadrature formulas, Error bounds |
26 | Hongwei Wang, Shuanghe Yu |
Tracking Control of Robot Manipulators via Orthogonal Polynomials Neural Network. |
ISNN (3) |
2009 |
DBLP DOI BibTeX RDF |
Orthogonal neural network, Lyapunov stability theory, Robot manipulators, Chebyshev polynomials |
26 | Hongwei Wang, Hong Gu |
Prediction of Chaotic Time Series Based on Neural Network with Legendre Polynomials. |
ISNN (1) |
2009 |
DBLP DOI BibTeX RDF |
Legendre orthogonal polynomials, Neural network, Singular value decomposition, Kalman filtering, Chaotic time series |
26 | Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton |
Algorithms for Modular Counting of Roots of Multivariate Polynomials. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Modular counting, Polynomials, Reed-Solomon codes |
26 | LianLin Li, Fang Li 0002 |
Solution of time-domain Maxwell equation with PML by using modified Laguerre polynomials. |
Sci. China Ser. F Inf. Sci. |
2008 |
DBLP DOI BibTeX RDF |
time-domain Maxwell equations, modified Laguerre polynomials, boundary value problems |
26 | Liying Ma, Khashayar Khorasani |
An Adaptively Constructing Multilayer Feedforward Neural Networks Using Hermite Polynomials. |
ICIC (2) |
2008 |
DBLP DOI BibTeX RDF |
Adaptive structure neural networks, Multilayer feedforward neural networks, Hermite polynomials |
26 | Alexander I. Barvinok |
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace. |
Found. Comput. Math. |
2007 |
DBLP DOI BibTeX RDF |
Wick formula, Gaussian measure, Algorithms, Integration, Polynomials, Random subspaces |
26 | Alexander B. Levin |
Gröbner bases with respect to several term orderings and multivariate dimension polynomials. |
ISSAC |
2007 |
DBLP DOI BibTeX RDF |
Gröbner basis, differential field extension, dimension polynomial, ore polynomials, p-dimensional ltration |
26 | Esmeralda Mainar, Juan Manuel Peña 0001 |
Running Error Analysis of Evaluation Algorithms for Bivariate Polynomials in Barycentric Bernstein Form. |
Computing |
2006 |
DBLP DOI BibTeX RDF |
bivariate polynomials defined on a triangle, VS algorithm, running error, forward error, Roundoff error, de Casteljau algorithm |
26 | Yuan Xu |
Approximation by Means of h-Harmonic Polynomials on the Unit Sphere. |
Adv. Comput. Math. |
2004 |
DBLP DOI BibTeX RDF |
reproducing kernel, orthogonal polynomials, projection operator |
26 | Willi Geiselmann, Willi Meier, Rainer Steinwandt |
An attack on the isomorphisms of polynomials problem with one secret. |
Int. J. Inf. Sec. |
2003 |
DBLP DOI BibTeX RDF |
Cryptanalysis, Public key cryptography, Multivariate polynomials |
26 | Dieter Gollmann |
Equally Spaced Polynomials, Dual Bases, and Multiplication in F2n. |
IEEE Trans. Computers |
2002 |
DBLP DOI BibTeX RDF |
Equally spaced polynomials, dual bases, multipliers for {rm F}_{2^n}, trace |
26 | Claude-Pierre Jeannerod |
A reduced form for perturbed matrix polynomials. |
ISSAC |
2002 |
DBLP DOI BibTeX RDF |
Newton diagram, matrix polynomials, perturbed eigenvalues, Smith normal form |
26 | Don Coppersmith |
Finding Small Solutions to Small Degree Polynomials. |
CaLC |
2001 |
DBLP DOI BibTeX RDF |
Modular polynomials, lattice reduction |
26 | Nicholas J. Redding |
Implicit Polynomials, Orthogonal Distance Regression, and the Closest Point on a Curve. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2000 |
DBLP DOI BibTeX RDF |
orthogonal distance regression, successive circular approximation, ionograms, Fitting, resultants, algebraic curve, implicit polynomials |
26 | Thomas Johansson 0001, Fredrik Jönsson |
Fast Correlation Attacks through Reconstruction of Linear Polynomials. |
CRYPTO |
2000 |
DBLP DOI BibTeX RDF |
reconstruction of polynomials, Stream ciphers, learning theory, correlation attacks |
26 | Matthias Krause 0001, Pavel Pudlák |
Computing Boolean Functions by Polynomials and Threshold Circuits. |
Comput. Complex. |
1998 |
DBLP DOI BibTeX RDF |
Complexity of Boolean functions, circuit lower bounds, representations by multivariate polynomials, threshold circuits |
26 | Bert Jüttler |
The dual basis functions for the Bernstein polynomials. |
Adv. Comput. Math. |
1998 |
DBLP DOI BibTeX RDF |
dual (reciprocal) basis, dual functional, 65D17, 41A10, Bernstein polynomials |
26 | Yagati N. Lakshman, B. David Saunders |
Sparse shifts for univariate polynomials. |
Appl. Algebra Eng. Commun. Comput. |
1996 |
DBLP DOI BibTeX RDF |
BCH decoding, Pochhammer basis, Chebyshev basis, Descartes’ rule of signs, Sparse polynomials, Real roots |
26 | Fokko du Cloux |
The state of the art in the computation of Kazhdan-Lusztig polynomials. |
Appl. Algebra Eng. Commun. Comput. |
1996 |
DBLP DOI BibTeX RDF |
Coxeter groups, Kazhdan-Lusztig polynomials, Finite-state automata |
26 | W. M. Chu |
Construction of irreducible polynomials using cubic transformation. |
Appl. Algebra Eng. Commun. Comput. |
1995 |
DBLP DOI BibTeX RDF |
Finite fields, irreducible polynomials |
26 | Tapas Kanungo, David M. Gay, Robert M. Haralick |
Constrained monotone regression of ROC curves and histograms using splines and polynomials. |
ICIP |
1995 |
DBLP DOI BibTeX RDF |
monotonically decreasing curves, single valued functions, parametric splines, parametric polynomials, monotonicity constraints, optimal operating points, cumulative density functions, monotonic splines, fitted spline function, end-point constraints, constrained monotone regression problem, mathematical programming language, AMPL, programming languages, statistical analysis, histograms, mathematical programming, curve fitting, curve fitting, splines (mathematics), receivers, ROC curves, receiver operating characteristics, parametric representation, density functions, closed form |
26 | Walter Gautschi |
Algorithm 726; ORTHPOL - a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. |
ACM Trans. Math. Softw. |
1994 |
DBLP DOI BibTeX RDF |
Gauss-type quadratic rules, orthogonal polynomials |
26 | Ilan Sadeh, Amir Averbuch |
Bounds on Parallel Computation of Multivariate Polynomials. |
ISTCS |
1992 |
DBLP DOI BibTeX RDF |
Complexity of parallel computation, Design and analysis of parallel algorithms, Maximal-degree, Dense polynomial, Multivariate polynomials |
25 | Hari Mohan Srivastava |
An Introductory Overview of Bessel Polynomials, the Generalized Bessel Polynomials and the q-Bessel Polynomials. |
Symmetry |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Siqintuya Jin, Muhammet Cihat Dagli, Feng Qi 0001 |
Degenerate Fubini-Type Polynomials and Numbers, Degenerate Apostol-Bernoulli Polynomials and Numbers, and Degenerate Apostol-Euler Polynomials and Numbers. |
Axioms |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Pingzhi Yuan, Cunsheng Ding |
Corrigenda to "Permutation polynomials over finite fields from a powerful lemma" [Finite Fields Appl. 17(2011) 560-574], "Further results on permutation polynomials over finite fields" [Finite Fields Appl. 27 (2014) 88-103], "Permutation polynomials of the form L(x) + Sa2k + Sb2k over q3k" [Finite Fields Appl. 29 (2014) 106-117]. |
Finite Fields Their Appl. |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Walter Gautschi, Carla Giordano |
Luigi Gatteschi's work on asymptotics of special functions and their zeros. |
Numer. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 26C10, 30C15, 33C10, 33C15, 41A60, 33C45 |
24 | Kiran S. Kedlaya, Christopher Umans |
Fast Modular Composition in any Characteristic. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Shay Gueron, Michael E. Kounavis |
A Technique for Accelerating Characteristic 2 Elliptic Curve Cryptography. |
ITNG |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Christopher Umans |
Fast polynomial factorization and modular composition in small characteristic. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
modular composition, multipoint evaluation, polynomial factorization |
24 | Ronghua Li, Chuankun Wu |
An Unconditionally Secure Protocol for Multi-Party Set Intersection. |
ACNS |
2007 |
DBLP DOI BibTeX RDF |
privacy-preserving set ntersection, Secure multi-party computation, unconditional security |
24 | John R. Cowles, Ruben Gamboa |
Unique factorization in ACL2: Euclidean domains. |
ACL2 |
2006 |
DBLP DOI BibTeX RDF |
Boyer-Moore logic, Euclidean domains, unique factorization, ACL2 |
24 | Parikshit Gopalan |
Constructing Ramsey Graphs from Boolean Function Representations. |
CCC |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Erich L. Kaltofen, Lihong Zhi |
Hybrid symbolic-numeric computation. |
ISSAC |
2006 |
DBLP DOI BibTeX RDF |
symbolic/numeric hybrid methods |
24 | Arno Eigenwillig, Vikram Sharma 0001, Chee-Keng Yap |
Almost tight recursion tree bounds for the Descartes method. |
ISSAC |
2006 |
DBLP DOI BibTeX RDF |
Davenport-Mahler bound, Descartes method, Descartes rule of signs, polynomial real root isolation, Bernstein basis |
24 | Zhiyuan Yan, Dilip V. Sarwate |
Area-efficient two-dimensional architectures for finite field inversion and division. |
ACM Great Lakes Symposium on VLSI |
2005 |
DBLP DOI BibTeX RDF |
cryptography, finite field, Reed-Solomon codes, arithmetic, galois field |
24 | David J. Jeffrey, Pratibha, K. B. Roach |
Affine transformations of algebraic numbers. |
ISSAC |
2005 |
DBLP DOI BibTeX RDF |
rootOf, affine transformation, algebraic numbers |
24 | Clemens Heitzinger, Andreas Hössinger, Siegfried Selberherr |
On smoothing three-dimensional Monte Carlo ion implantation simulation results. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis |
On the Efficient Generation of Elliptic Curves over Prime Fields. |
CHES |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Michael Bulmer, Desmond Fearnley-Sander, Timothy Stokes 0001 |
The Kinds of Truth of Geometry Theorems. |
Automated Deduction in Geometry |
2000 |
DBLP DOI BibTeX RDF |
|
24 | James W. Bond, Stefan Hui, Hank Schmidt |
The Euclidean Algorithm and Primitive Polypomials over Finite Fields. |
AAECC |
1999 |
DBLP DOI BibTeX RDF |
|
24 | Bernard Mourrain |
A New Criterion for Normal Form Algorithms. |
AAECC |
1999 |
DBLP DOI BibTeX RDF |
|
24 | Saugata Basu, Richard Pollack, Marie-Françoise Roy |
On the Combinatorial and Algebraic Complexity of Quantifier Elimination. |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
Tarski-Seidenberg principle, quantifier elimination, real closed fields |
24 | K. Gatemann |
Symbolic Solution Polynomial Equation Systems with Symmetry. |
ISSAC |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Ricardo Ferré |
An algebraic approach to multidimensional convolution (abstract only). |
ACM Conference on Computer Science |
1987 |
DBLP DOI BibTeX RDF |
|
24 | A. Ecker |
Finite Semigroups and the RSA-Cryptosystem. |
EUROCRYPT |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Eid H. Doha, Ali H. Bhrawy, Waleed M. Abd-Elhameed |
Jacobi spectral Galerkin method for elliptic Neumann problems. |
Numer. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Neumann boundary condition, Spectral-Galerkin method, Fast elliptic spectral solver, Jacobi polynomials, Tensor product, Helmholtz equation |
24 | Nelson H. F. Beebe, James S. Ball |
Algorithm 867: QUADLOG - a package of routines for generating Gauss-related quadrature for two classes of logarithmic weight functions. |
ACM Trans. Math. Softw. |
2007 |
DBLP DOI BibTeX RDF |
EISPACK pythag() function, Gauss-Chebyshev quadrature, Gauss-Jacobi quadrature, Gauss-Laguerre quadrature, Gauss-Legendre quadrature, Gauss-type quadrature, Maple symbolic algebra system, Mehler quadrature, gamma-function testing, logarithmic integrals, machine-epsilon testing, psi-function testing, software testing, software portability, orthogonal polynomials |
24 | James S. Ball, Nelson H. F. Beebe |
Efficient Gauss-related quadrature for two classes of logarithmic weight functions. |
ACM Trans. Math. Softw. |
2007 |
DBLP DOI BibTeX RDF |
Gauss-Chebyshev quadrature, Gauss-Jacobi quadrature, Gauss-Laguerre quadrature, Gauss-Legendre quadrature, Gauss-related quadrature, Mehler quadrature, logarithmic integrals, orthogonal polynomials |
24 | Caiming Zhang 0001, Ji Xiuhua, Liu Hui |
Determining Knots with Quadratic Polynomial Precision. |
International Conference on Computational Science (2) |
2007 |
DBLP DOI BibTeX RDF |
polynomials, parametric curves, knots |
24 | Abedelaziz Mohaisen, YoungJae Maeng, DaeHun Nyang |
On Grid-Based Key Pre-distribution: Toward a Better Connectivity in Wireless Sensor Network. |
PAKDD Workshops |
2007 |
DBLP DOI BibTeX RDF |
Bivariate Symmetric Polynomials, Sensor Networks, Key Distribution, Network Connectivity |
24 | Xin Li 0009, Marc Moreno Maza |
Multithreaded parallel implementation of arithmetic operations modulo a triangular set. |
PASCO |
2007 |
DBLP DOI BibTeX RDF |
algorithms, parallelization, polynomials, high-performance, normal form |
24 | Pan Xiang, Chen Qi Hua, Liu Zhi |
Content-Based 3D Retrieval by Krawtchouk Moments. |
ICIAR (2) |
2006 |
DBLP DOI BibTeX RDF |
3D Krawtchouk moments, Content-based 3D retrieval, Discrete orthogonal polynomials |
24 | Jean-Paul Calvi |
Intertwining unisolvent arrays for multivariate Lagrange interpolation. |
Adv. Comput. Math. |
2005 |
DBLP DOI BibTeX RDF |
unisolvent arrays, multivariate polynomials, Lagrange interpolation |
24 | Jintai Ding, Dieter Schmidt |
Rainbow, a New Multivariable Polynomial Signature Scheme. |
ACNS |
2005 |
DBLP DOI BibTeX RDF |
Oil and Vinegar, public-key, multivariable, quadratic polynomials |
24 | Takakazu Satoh |
On Degrees of Polynomial Interpolations Related to Elliptic Curve Cryptography. |
WCC |
2005 |
DBLP DOI BibTeX RDF |
division polynomials, Elliptic curves, polynomial interpolation |
24 | Nira Dyn, David Levin, Ariel Luzzatto |
Exponentials Reproducing Subdivision Schemes. |
Found. Comput. Math. |
2003 |
DBLP DOI BibTeX RDF |
Exponential polynomials, AMS Classification. 41A05, 42A15, 42C99, Interpolation, Subdivision, 65D05, 41A30, 65D99 |
24 | Hao-Yung Lo, Hsiu-Feng Lin, Chichyang Chen, Jenshiuh Liu, Chia-Cheng Liu |
Built-in Test with Modified-Booth High-Speed Pipelined Multipliers and Dividers. |
J. Electron. Test. |
2003 |
DBLP DOI BibTeX RDF |
generator, BIST, computer arithmetic, polynomials, VLSI design, multiplication, division |
24 | André Weimerskirch, Douglas Stebila, Sheueling Chang Shantz |
Generic GF(2) Arithmetic in Software and Its Application to ECC. |
ACISP |
2003 |
DBLP DOI BibTeX RDF |
Dense Field Polynomials, Field Multiplication, Field Reduction, Elliptic Curves, Koblitz Curves, Binary Fields |
24 | Nicolas T. Courtois, Willi Meier |
Algebraic Attacks on Stream Ciphers with Linear Feedback. |
EUROCRYPT |
2003 |
DBLP DOI BibTeX RDF |
Algebraic attacks on stream ciphers, factoring multivariate polynomials, overdefined problems, ciphertext-only attacks, Toyocrypt, Cryptrec, LILI-128, Boolean functions, nonlinear filtering, pseudo-random generators, Nessie, XL algorithm, multivariate equations |
24 | Zygmunt A. Garczarczyk |
Parallel Schemes of Computation for Bernstein Coefficients and Their Application. |
PARELEC |
2002 |
DBLP DOI BibTeX RDF |
nonlinear algebraic equations, interval analysis techniques, range evaluations, Bernstein polynomials |
24 | Vince Grolmusz |
Co-orthogonal Codes. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
non-linear codes, co-orthogonal codes, codes and set-systems, multi-linear polynomials, composite modulus |
24 | Sandeepan Chowdhury, Subhamoy Maitra |
Efficient Software Implementation of Linear Feedback Shift Registers. |
INDOCRYPT |
2001 |
DBLP DOI BibTeX RDF |
Block Oriented LFSR, Connection Polynomials, Stream Cipher |
24 | Georg Heinig |
Fast and Superfast Algorithms for Hankel-Like Matrices Related to Orthogonal Polynominals. |
NAA |
2000 |
DBLP DOI BibTeX RDF |
Hankel matrix, fast algorithm AMS(MOS) Subject Classification: 47B35, 15A09, orthogonal polynomials, 15A23 |
24 | Boris Igelnik, Yaakov Kogan, Vladimir Kriman, Debasis Mitra 0001 |
A new computational approach for stochastic fluid models of multiplexers with heterogeneous sources. |
Queueing Syst. Theory Appl. |
1995 |
DBLP DOI BibTeX RDF |
buffer overflow probability, two-dimensional interpolating polynomials, Fluid models, ATM multiplexing, recursive computation |
24 | Dimitrios Kagaris, Spyros Tragoudas |
Avoiding linear dependencies in LFSR test pattern generators. |
J. Electron. Test. |
1995 |
DBLP DOI BibTeX RDF |
ATPG, BIST, LFSR, characteristic polynomials, pseudo-random testing |
24 | John P. Boyd 0001 |
Chebyshev domain truncation is inferior to fourier domain truncation for solving problems on an infinite interval. |
J. Sci. Comput. |
1988 |
DBLP DOI BibTeX RDF |
Spectral methods, Fourier series, Chebyshev polynomials |
23 | Pew-Thian Yap, Paramesran Raveendran, Seng-Huat Ong |
Image Analysis Using Hahn Moments. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2007 |
DBLP DOI BibTeX RDF |
Hahn polynomials, Hahn moments, discrete orthogonal polynomials, normalized convolution |
23 | Ilyas Eker |
The design of robust multi-loop-cascaded hydro governors. |
Eng. Comput. |
2004 |
DBLP DOI BibTeX RDF |
Nomenclature, Polynomial notation is employed and the polynomials are assumed to be functions of the complex s variable, X* denotes complex conjugate of the X., a. S: complex frequency and is the frequency., b. R+: Set of all positive real numbers, c. R: Set of all real numbers, d. R(.): Set of all real rational functions, e. R[.]: Set of finite polynomials with real coefficients, f. Rmxm(.): Set of all real (mxm) matrices, g. Rmxm[.]: Set of polynomial (mxm) matrices |
23 | Camil Demetrescu, Giuseppe F. Italiano |
Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
fully dynamic transitive closure, unit worst-case cost, amortized time, single-operation complexity, subquadratic algorithm, computational complexity, randomized algorithm, queries, directed graphs, directed graphs, polynomials, polynomials, directed acyclic graphs, matrix multiplication, matrix multiplication, deterministic algorithms, deterministic algorithm, randomised algorithms |
23 | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
On the Applications of Multiplicity Automata in Learning. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
multiplicity automata, DNF formulae learnability, minimal multiplicity automaton, multiplicity automata learning, finite field polynomials, infinite field bounded-degree polynomials, decision trees, states, matrix, automata theory, automata theory, query complexity |
23 | Maurice Mignotte |
On the distance between the roots of a polynomial. |
Appl. Algebra Eng. Commun. Comput. |
1995 |
DBLP DOI BibTeX RDF |
Roots of a polynomial, Separating the roots, Complex polynomials, Integer polynomials |
23 | Noam Nisan, Avi Wigderson |
Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
restricted classes, computational complexity, lower bounds, digital arithmetic, polynomials, logic circuits, arithmetic circuits, multivariate polynomials, complexity measure, minimisation of switching nets, partial derivatives |
23 | Saugata Basu, Richard Pollack, Marie-Françoise Roy |
On the Combinatorial and Algebraic Complexity of Quantifier Elimination |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
complex geometry, first order formulae, asymptotically fastest algorithm, input polynomials, sign partition, polynomials, quantifier elimination, combinatorial complexity, algebraic complexity, real closed fields, first order theory, complexity bound |
23 | M. Anwarul Hasan, Muzhong Wang, Vijay K. Bhargava |
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields. |
IEEE Trans. Computers |
1993 |
DBLP DOI BibTeX RDF |
Massey-Omura parallel multiplier, cyclically shifted versions, input cyclic shift, lower circuit complexity, redundancy, finite fields, digital arithmetic, polynomials, polynomials, multiplying circuits |
20 | Walter Gautschi |
Variable-precision recurrence coefficients for nonstandard orthogonal polynomials. |
Numer. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 3304, 33C47 |
20 | Walter Gautschi |
On conjectured inequalities for zeros of Jacobi polynomials. |
Numer. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 33C45 |
20 | Martin R. Albrecht, Craig Gentry, Shai Halevi, Jonathan Katz |
Attacking cryptographic schemes based on "perturbation polynomials". |
CCS |
2009 |
DBLP DOI BibTeX RDF |
pairwise key establishment, random perturbation polynomial, sensor network security |
20 | Pavel Emeliyanenko |
Efficient Multiplication of Polynomials on Graphics Hardware. |
APPT |
2009 |
DBLP DOI BibTeX RDF |
large integer arithmetic, parallel computations, GPU, graphics hardware, CUDA |
20 | Ido Ben-Eliezer, Rani Hod, Shachar Lovett |
Random Low Degree Polynomials are Hard to Approximate. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan |
Efficiently Testing Sparse GF(2) Polynomials. |
ICALP (1) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Pascale Charpin, Gohar M. Kyureghyan |
On a Class of Permutation Polynomials over F2m. |
SETA |
2008 |
DBLP DOI BibTeX RDF |
linearized polynomial, Boolean function, trace, linear structure, Permutation polynomial |
20 | Benny Godlin, Tomer Kotek, Johann A. Makowsky |
Evaluations of Graph Polynomials. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Wei Zhu, Zhe-zhao Zeng, Dong-mei Lin |
An Adaptive Algorithm Finding Multiple Roots of Polynomials. |
ISNN (2) |
2008 |
DBLP DOI BibTeX RDF |
Multiple Real or Complex Roots, Variable Learning Rate, Adaptive Algorithm |
20 | Robert S. Coulter, Marie Henderson, Pamela Kosick |
Planar polynomials for commutative semifields with specified nuclei. |
Des. Codes Cryptogr. |
2007 |
DBLP DOI BibTeX RDF |
AMS Classifications 11T06, 12K10 |
20 | Solomon W. Golomb, Pey-Feng Lee |
Irreducible Polynomials Which Divide Trinomials Over GF, (2). |
IEEE Trans. Inf. Theory |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Robert M. Corless, Nargol Rezvani, Amirhossein Amiraslani |
Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases. |
Math. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
Pseudospectra, matrix polynomial, Lebesgue functions, Lebesgue constants, conditioning |
20 | Paul C. Leopardi |
Positive weight quadrature on the sphere and monotonicities of Jacobi polynomials. |
Numer. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) Primary 65D32, 33C45 |
20 | Christian Bey, Martin Henk, Jörg M. Wills |
Notes on the Roots of Ehrhart Polynomials. |
Discret. Comput. Geom. |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Hajime Machida, Michael Pinsker |
Polynomials as Generators of Minimal Clones. |
ISMVL |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Liangyu Chen 0001, Zhenbing Zeng |
Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?. |
ASCM |
2007 |
DBLP DOI BibTeX RDF |
Homogeneous symmetric polynomial, Positive Semi- Definiteness, Difference Substitution |
20 | Maurice J. Jansen, Kenneth W. Regan |
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives |
20 | Guillaume Malod |
The Complexity of Polynomials and Their Coefficient Functions. |
CCC |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Mohab Safey El Din, Philippe Trebuchet |
POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations. |
PASCO |
2007 |
DBLP DOI BibTeX RDF |
univariate polynomial, scalability, symbolic-numeric computation |
Displaying result #201 - #300 of 9920 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|