The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for polynomials with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1952-1961 (20) 1962-1965 (19) 1966-1967 (20) 1968-1969 (28) 1970-1972 (20) 1973-1974 (17) 1975-1976 (36) 1977 (16) 1978 (21) 1979 (21) 1980 (28) 1981 (18) 1982 (17) 1983 (18) 1984 (24) 1985 (36) 1986 (31) 1987 (41) 1988 (48) 1989 (45) 1990 (74) 1991 (80) 1992 (87) 1993 (76) 1994 (89) 1995 (91) 1996 (123) 1997 (122) 1998 (128) 1999 (139) 2000 (197) 2001 (210) 2002 (212) 2003 (265) 2004 (309) 2005 (380) 2006 (383) 2007 (384) 2008 (475) 2009 (386) 2010 (322) 2011 (356) 2012 (328) 2013 (339) 2014 (340) 2015 (387) 2016 (314) 2017 (328) 2018 (376) 2019 (391) 2020 (396) 2021 (374) 2022 (407) 2023 (415) 2024 (113)
Publication types (Num. hits)
article(7304) book(8) incollection(69) inproceedings(2500) phdthesis(39)
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
27Afaq Ahmad 0001, N. K. Nanda, K. Garg Are Primitive Polynomials Always Best in Signature Analysis? Search on Bibsonomy IEEE Des. Test Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
27Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima On Determining the Solvability of Polynomials. Search on Bibsonomy ISSAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
27Nicola Santoro, Stuart J. Sidney, Jorge Urrutia Geometric Containment, Common Roots of Polynomials and Partial Orders. Search on Bibsonomy STACS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
27Rüdiger Loos An Analysis of the Krönecker Algorithm for Factorization of Algebraic Polynomials. Search on Bibsonomy AAECC The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
27Oscar Moreno de Ayala Discriminants and the irreducibility of a class of polynomials. Search on Bibsonomy AAECC The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
26Ruymá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. Search on Bibsonomy Numer. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Gaussian quadrature formulas, Szeg? polynomials, Szeg? quadrature formulas, Interpolatory type quadrature formulas, Error bounds
26Hongwei Wang, Shuanghe Yu Tracking Control of Robot Manipulators via Orthogonal Polynomials Neural Network. Search on Bibsonomy ISNN (3) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Orthogonal neural network, Lyapunov stability theory, Robot manipulators, Chebyshev polynomials
26Hongwei Wang, Hong Gu Prediction of Chaotic Time Series Based on Neural Network with Legendre Polynomials. Search on Bibsonomy ISNN (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Legendre orthogonal polynomials, Neural network, Singular value decomposition, Kalman filtering, Chaotic time series
26Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton Algorithms for Modular Counting of Roots of Multivariate Polynomials. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Modular counting, Polynomials, Reed-Solomon codes
26LianLin Li, Fang Li 0002 Solution of time-domain Maxwell equation with PML by using modified Laguerre polynomials. Search on Bibsonomy Sci. China Ser. F Inf. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF time-domain Maxwell equations, modified Laguerre polynomials, boundary value problems
26Liying Ma, Khashayar Khorasani An Adaptively Constructing Multilayer Feedforward Neural Networks Using Hermite Polynomials. Search on Bibsonomy ICIC (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Adaptive structure neural networks, Multilayer feedforward neural networks, Hermite polynomials
26Alexander I. Barvinok Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Wick formula, Gaussian measure, Algorithms, Integration, Polynomials, Random subspaces
26Alexander B. Levin Gröbner bases with respect to several term orderings and multivariate dimension polynomials. Search on Bibsonomy ISSAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Gröbner basis, differential field extension, dimension polynomial, ore polynomials, p-dimensional ltration
26Esmeralda Mainar, Juan Manuel Peña 0001 Running Error Analysis of Evaluation Algorithms for Bivariate Polynomials in Barycentric Bernstein Form. Search on Bibsonomy Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF bivariate polynomials defined on a triangle, VS algorithm, running error, forward error, Roundoff error, de Casteljau algorithm
26Yuan Xu Approximation by Means of h-Harmonic Polynomials on the Unit Sphere. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF reproducing kernel, orthogonal polynomials, projection operator
26Willi Geiselmann, Willi Meier, Rainer Steinwandt An attack on the isomorphisms of polynomials problem with one secret. Search on Bibsonomy Int. J. Inf. Sec. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Cryptanalysis, Public key cryptography, Multivariate polynomials
26Dieter Gollmann Equally Spaced Polynomials, Dual Bases, and Multiplication in F2n. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Equally spaced polynomials, dual bases, multipliers for {rm F}_{2^n}, trace
26Claude-Pierre Jeannerod A reduced form for perturbed matrix polynomials. Search on Bibsonomy ISSAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Newton diagram, matrix polynomials, perturbed eigenvalues, Smith normal form
26Don Coppersmith Finding Small Solutions to Small Degree Polynomials. Search on Bibsonomy CaLC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Modular polynomials, lattice reduction
26Nicholas J. Redding Implicit Polynomials, Orthogonal Distance Regression, and the Closest Point on a Curve. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF orthogonal distance regression, successive circular approximation, ionograms, Fitting, resultants, algebraic curve, implicit polynomials
26Thomas Johansson 0001, Fredrik Jönsson Fast Correlation Attacks through Reconstruction of Linear Polynomials. Search on Bibsonomy CRYPTO The full citation details ... 2000 DBLP  DOI  BibTeX  RDF reconstruction of polynomials, Stream ciphers, learning theory, correlation attacks
26Matthias Krause 0001, Pavel Pudlák Computing Boolean Functions by Polynomials and Threshold Circuits. Search on Bibsonomy Comput. Complex. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Complexity of Boolean functions, circuit lower bounds, representations by multivariate polynomials, threshold circuits
26Bert Jüttler The dual basis functions for the Bernstein polynomials. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF dual (reciprocal) basis, dual functional, 65D17, 41A10, Bernstein polynomials
26Yagati N. Lakshman, B. David Saunders Sparse shifts for univariate polynomials. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF BCH decoding, Pochhammer basis, Chebyshev basis, Descartes’ rule of signs, Sparse polynomials, Real roots
26Fokko du Cloux The state of the art in the computation of Kazhdan-Lusztig polynomials. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Coxeter groups, Kazhdan-Lusztig polynomials, Finite-state automata
26W. M. Chu Construction of irreducible polynomials using cubic transformation. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Finite fields, irreducible polynomials
26Tapas Kanungo, David M. Gay, Robert M. Haralick Constrained monotone regression of ROC curves and histograms using splines and polynomials. Search on Bibsonomy ICIP The full citation details ... 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
26Walter Gautschi Algorithm 726; ORTHPOL - a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF Gauss-type quadratic rules, orthogonal polynomials
26Ilan Sadeh, Amir Averbuch Bounds on Parallel Computation of Multivariate Polynomials. Search on Bibsonomy ISTCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF Complexity of parallel computation, Design and analysis of parallel algorithms, Maximal-degree, Dense polynomial, Multivariate polynomials
25Hari Mohan Srivastava An Introductory Overview of Bessel Polynomials, the Generalized Bessel Polynomials and the q-Bessel Polynomials. Search on Bibsonomy Symmetry The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Siqintuya 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. Search on Bibsonomy Axioms The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
25Pingzhi 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]. Search on Bibsonomy Finite Fields Their Appl. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
24Walter Gautschi, Carla Giordano Luigi Gatteschi's work on asymptotics of special functions and their zeros. Search on Bibsonomy Numer. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 26C10, 30C15, 33C10, 33C15, 41A60, 33C45
24Kiran S. Kedlaya, Christopher Umans Fast Modular Composition in any Characteristic. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
24Shay Gueron, Michael E. Kounavis A Technique for Accelerating Characteristic 2 Elliptic Curve Cryptography. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
24Christopher Umans Fast polynomial factorization and modular composition in small characteristic. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF modular composition, multipoint evaluation, polynomial factorization
24Ronghua Li, Chuankun Wu An Unconditionally Secure Protocol for Multi-Party Set Intersection. Search on Bibsonomy ACNS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF privacy-preserving set ntersection, Secure multi-party computation, unconditional security
24John R. Cowles, Ruben Gamboa Unique factorization in ACL2: Euclidean domains. Search on Bibsonomy ACL2 The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Boyer-Moore logic, Euclidean domains, unique factorization, ACL2
24Parikshit Gopalan Constructing Ramsey Graphs from Boolean Function Representations. Search on Bibsonomy CCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
24Erich L. Kaltofen, Lihong Zhi Hybrid symbolic-numeric computation. Search on Bibsonomy ISSAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF symbolic/numeric hybrid methods
24Arno Eigenwillig, Vikram Sharma 0001, Chee-Keng Yap Almost tight recursion tree bounds for the Descartes method. Search on Bibsonomy ISSAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Davenport-Mahler bound, Descartes method, Descartes rule of signs, polynomial real root isolation, Bernstein basis
24Zhiyuan Yan, Dilip V. Sarwate Area-efficient two-dimensional architectures for finite field inversion and division. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF cryptography, finite field, Reed-Solomon codes, arithmetic, galois field
24David J. Jeffrey, Pratibha, K. B. Roach Affine transformations of algebraic numbers. Search on Bibsonomy ISSAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF rootOf, affine transformation, algebraic numbers
24Clemens Heitzinger, Andreas Hössinger, Siegfried Selberherr On smoothing three-dimensional Monte Carlo ion implantation simulation results. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
24Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis On the Efficient Generation of Elliptic Curves over Prime Fields. Search on Bibsonomy CHES The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
24Michael Bulmer, Desmond Fearnley-Sander, Timothy Stokes 0001 The Kinds of Truth of Geometry Theorems. Search on Bibsonomy Automated Deduction in Geometry The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
24James W. Bond, Stefan Hui, Hank Schmidt The Euclidean Algorithm and Primitive Polypomials over Finite Fields. Search on Bibsonomy AAECC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
24Bernard Mourrain A New Criterion for Normal Form Algorithms. Search on Bibsonomy AAECC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
24Saugata Basu, Richard Pollack, Marie-Françoise Roy On the Combinatorial and Algebraic Complexity of Quantifier Elimination. Search on Bibsonomy J. ACM The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Tarski-Seidenberg principle, quantifier elimination, real closed fields
24K. Gatemann Symbolic Solution Polynomial Equation Systems with Symmetry. Search on Bibsonomy ISSAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
24Ricardo Ferré An algebraic approach to multidimensional convolution (abstract only). Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
24A. Ecker Finite Semigroups and the RSA-Cryptosystem. Search on Bibsonomy EUROCRYPT The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
24Eid H. Doha, Ali H. Bhrawy, Waleed M. Abd-Elhameed Jacobi spectral Galerkin method for elliptic Neumann problems. Search on Bibsonomy Numer. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Neumann boundary condition, Spectral-Galerkin method, Fast elliptic spectral solver, Jacobi polynomials, Tensor product, Helmholtz equation
24Nelson 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. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 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
24James S. Ball, Nelson H. F. Beebe Efficient Gauss-related quadrature for two classes of logarithmic weight functions. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 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
24Caiming Zhang 0001, Ji Xiuhua, Liu Hui Determining Knots with Quadratic Polynomial Precision. Search on Bibsonomy International Conference on Computational Science (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF polynomials, parametric curves, knots
24Abedelaziz Mohaisen, YoungJae Maeng, DaeHun Nyang On Grid-Based Key Pre-distribution: Toward a Better Connectivity in Wireless Sensor Network. Search on Bibsonomy PAKDD Workshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Bivariate Symmetric Polynomials, Sensor Networks, Key Distribution, Network Connectivity
24Xin Li 0009, Marc Moreno Maza Multithreaded parallel implementation of arithmetic operations modulo a triangular set. Search on Bibsonomy PASCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF algorithms, parallelization, polynomials, high-performance, normal form
24Pan Xiang, Chen Qi Hua, Liu Zhi Content-Based 3D Retrieval by Krawtchouk Moments. Search on Bibsonomy ICIAR (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 3D Krawtchouk moments, Content-based 3D retrieval, Discrete orthogonal polynomials
24Jean-Paul Calvi Intertwining unisolvent arrays for multivariate Lagrange interpolation. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF unisolvent arrays, multivariate polynomials, Lagrange interpolation
24Jintai Ding, Dieter Schmidt Rainbow, a New Multivariable Polynomial Signature Scheme. Search on Bibsonomy ACNS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Oil and Vinegar, public-key, multivariable, quadratic polynomials
24Takakazu Satoh On Degrees of Polynomial Interpolations Related to Elliptic Curve Cryptography. Search on Bibsonomy WCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF division polynomials, Elliptic curves, polynomial interpolation
24Nira Dyn, David Levin, Ariel Luzzatto Exponentials Reproducing Subdivision Schemes. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Exponential polynomials, AMS Classification. 41A05, 42A15, 42C99, Interpolation, Subdivision, 65D05, 41A30, 65D99
24Hao-Yung Lo, Hsiu-Feng Lin, Chichyang Chen, Jenshiuh Liu, Chia-Cheng Liu Built-in Test with Modified-Booth High-Speed Pipelined Multipliers and Dividers. Search on Bibsonomy J. Electron. Test. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF generator, BIST, computer arithmetic, polynomials, VLSI design, multiplication, division
24André Weimerskirch, Douglas Stebila, Sheueling Chang Shantz Generic GF(2) Arithmetic in Software and Its Application to ECC. Search on Bibsonomy ACISP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Dense Field Polynomials, Field Multiplication, Field Reduction, Elliptic Curves, Koblitz Curves, Binary Fields
24Nicolas T. Courtois, Willi Meier Algebraic Attacks on Stream Ciphers with Linear Feedback. Search on Bibsonomy EUROCRYPT The full citation details ... 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
24Zygmunt A. Garczarczyk Parallel Schemes of Computation for Bernstein Coefficients and Their Application. Search on Bibsonomy PARELEC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF nonlinear algebraic equations, interval analysis techniques, range evaluations, Bernstein polynomials
24Vince Grolmusz Co-orthogonal Codes. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF non-linear codes, co-orthogonal codes, codes and set-systems, multi-linear polynomials, composite modulus
24Sandeepan Chowdhury, Subhamoy Maitra Efficient Software Implementation of Linear Feedback Shift Registers. Search on Bibsonomy INDOCRYPT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Block Oriented LFSR, Connection Polynomials, Stream Cipher
24Georg Heinig Fast and Superfast Algorithms for Hankel-Like Matrices Related to Orthogonal Polynominals. Search on Bibsonomy NAA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Hankel matrix, fast algorithm AMS(MOS) Subject Classification: 47B35, 15A09, orthogonal polynomials, 15A23
24Boris Igelnik, Yaakov Kogan, Vladimir Kriman, Debasis Mitra 0001 A new computational approach for stochastic fluid models of multiplexers with heterogeneous sources. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF buffer overflow probability, two-dimensional interpolating polynomials, Fluid models, ATM multiplexing, recursive computation
24Dimitrios Kagaris, Spyros Tragoudas Avoiding linear dependencies in LFSR test pattern generators. Search on Bibsonomy J. Electron. Test. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF ATPG, BIST, LFSR, characteristic polynomials, pseudo-random testing
24John P. Boyd 0001 Chebyshev domain truncation is inferior to fourier domain truncation for solving problems on an infinite interval. Search on Bibsonomy J. Sci. Comput. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF Spectral methods, Fourier series, Chebyshev polynomials
23Pew-Thian Yap, Paramesran Raveendran, Seng-Huat Ong Image Analysis Using Hahn Moments. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Hahn polynomials, Hahn moments, discrete orthogonal polynomials, normalized convolution
23Ilyas Eker The design of robust multi-loop-cascaded hydro governors. Search on Bibsonomy Eng. Comput. The full citation details ... 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
23Camil Demetrescu, Giuseppe F. Italiano Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. Search on Bibsonomy FOCS The full citation details ... 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
23Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio On the Applications of Multiplicity Automata in Learning. Search on Bibsonomy FOCS The full citation details ... 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
23Maurice Mignotte On the distance between the roots of a polynomial. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Roots of a polynomial, Separating the roots, Complex polynomials, Integer polynomials
23Noam Nisan, Avi Wigderson Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). Search on Bibsonomy FOCS The full citation details ... 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
23Saugata Basu, Richard Pollack, Marie-Françoise Roy On the Combinatorial and Algebraic Complexity of Quantifier Elimination Search on Bibsonomy FOCS The full citation details ... 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
23M. Anwarul Hasan, Muzhong Wang, Vijay K. Bhargava A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 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
20Walter Gautschi Variable-precision recurrence coefficients for nonstandard orthogonal polynomials. Search on Bibsonomy Numer. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 3304, 33C47
20Walter Gautschi On conjectured inequalities for zeros of Jacobi polynomials. Search on Bibsonomy Numer. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 33C45
20Martin R. Albrecht, Craig Gentry, Shai Halevi, Jonathan Katz Attacking cryptographic schemes based on "perturbation polynomials". Search on Bibsonomy CCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF pairwise key establishment, random perturbation polynomial, sensor network security
20Pavel Emeliyanenko Efficient Multiplication of Polynomials on Graphics Hardware. Search on Bibsonomy APPT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF large integer arithmetic, parallel computations, GPU, graphics hardware, CUDA
20Ido Ben-Eliezer, Rani Hod, Shachar Lovett Random Low Degree Polynomials are Hard to Approximate. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
20Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan Efficiently Testing Sparse GF(2) Polynomials. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
20Pascale Charpin, Gohar M. Kyureghyan On a Class of Permutation Polynomials over F2m. Search on Bibsonomy SETA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF linearized polynomial, Boolean function, trace, linear structure, Permutation polynomial
20Benny Godlin, Tomer Kotek, Johann A. Makowsky Evaluations of Graph Polynomials. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
20Wei Zhu, Zhe-zhao Zeng, Dong-mei Lin An Adaptive Algorithm Finding Multiple Roots of Polynomials. Search on Bibsonomy ISNN (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Multiple Real or Complex Roots, Variable Learning Rate, Adaptive Algorithm
20Robert S. Coulter, Marie Henderson, Pamela Kosick Planar polynomials for commutative semifields with specified nuclei. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF AMS Classifications 11T06, 12K10
20Solomon W. Golomb, Pey-Feng Lee Irreducible Polynomials Which Divide Trinomials Over GF, (2). Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
20Robert M. Corless, Nargol Rezvani, Amirhossein Amiraslani Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases. Search on Bibsonomy Math. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Pseudospectra, matrix polynomial, Lebesgue functions, Lebesgue constants, conditioning
20Paul C. Leopardi Positive weight quadrature on the sphere and monotonicities of Jacobi polynomials. Search on Bibsonomy Numer. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) Primary 65D32, 33C45
20Christian Bey, Martin Henk, Jörg M. Wills Notes on the Roots of Ehrhart Polynomials. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
20Hajime Machida, Michael Pinsker Polynomials as Generators of Minimal Clones. Search on Bibsonomy ISMVL The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
20Liangyu Chen 0001, Zhenbing Zeng Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?. Search on Bibsonomy ASCM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Homogeneous symmetric polynomial, Positive Semi- Definiteness, Difference Substitution
20Maurice J. Jansen, Kenneth W. Regan "Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives
20Guillaume Malod The Complexity of Polynomials and Their Coefficient Functions. Search on Bibsonomy CCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
20Mohab Safey El Din, Philippe Trebuchet POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations. Search on Bibsonomy PASCO The full citation details ... 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][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license