The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1955-1960 (23) 1961-1963 (23) 1964-1966 (18) 1967 (18) 1968-1969 (28) 1970-1971 (22) 1972 (15) 1973 (20) 1974 (30) 1975 (25) 1976 (49) 1977 (26) 1978 (30) 1979 (34) 1980 (49) 1981 (56) 1982 (48) 1983 (49) 1984 (81) 1985 (101) 1986 (106) 1987 (116) 1988 (172) 1989 (207) 1990 (243) 1991 (222) 1992 (283) 1993 (294) 1994 (331) 1995 (335) 1996 (371) 1997 (399) 1998 (448) 1999 (541) 2000 (580) 2001 (732) 2002 (811) 2003 (913) 2004 (1247) 2005 (1374) 2006 (1552) 2007 (1616) 2008 (1717) 2009 (1410) 2010 (697) 2011 (630) 2012 (669) 2013 (705) 2014 (687) 2015 (733) 2016 (736) 2017 (747) 2018 (790) 2019 (880) 2020 (895) 2021 (881) 2022 (930) 2023 (975) 2024 (283)
Publication types (Num. hits)
article(14105) book(21) data(1) incollection(97) inproceedings(13633) phdthesis(146)
Venues (Conferences, Journals, ...)
CoRR(2309) FOCS(413) ISSAC(398) STOC(364) SODA(348) ICALP(275) IACR Cryptol. ePrint Arch.(273) J. ACM(253) MFCS(252) STACS(252) ISAAC(249) Appl. Math. Comput.(248) Theor. Comput. Sci.(223) J. Symb. Comput.(216) CDC(212) Algorithmica(209) More (+10 of total 2779)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12402 occurrences of 4451 keywords

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