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
15Amin Coja-Oghlan Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
15Ali Dasdan A strongly polynomial-time algorithm for over-constraint resolution: efficient debugging of timing constraint violations. Search on Bibsonomy CODES The full citation details ... 2002 DBLP  DOI  BibTeX  RDF scheduling, high-level synthesis, constraint satisfaction, timing constraints, behavioral synthesis, rate analysis
15Markus Müller-Olm, Helmut Seidl Polynomial Constants Are Decidable. Search on Bibsonomy SAS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
15Mary Cryan, Martin E. Dyer A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
15Eugene M. Luks, Takunari Miyazaki Polynomial-time normalizers for permutation groups with restricted composition factors. Search on Bibsonomy ISSAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
15Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables. Search on Bibsonomy FCT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Grace W. Rumantir, Chris S. Wallace Sampling of Highly Correlated Data for Polynomial Regression and Model Discovery. Search on Bibsonomy IDA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Robert Seater, David Wonnacott Polynomial Time Array Dataflow Analysis. Search on Bibsonomy LCPC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Zhiping Lin 0001, Jiang Qian Ying, Li Xu 0004 Further results on primitive factorizations for nD polynomial matrices. Search on Bibsonomy ISCAS (2) The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Fabrice Monteiro, Abbas Dandache, Bernard Lepley Fast Configurable Polynomial Division for Error Control Coding Applications. Search on Bibsonomy IOLTW The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Thomas Malzbender, Dan Gelb, Hans J. Wolters Polynomial texture maps. Search on Bibsonomy SIGGRAPH The full citation details ... 2001 DBLP  DOI  BibTeX  RDF image processing, image-based rendering, texture mapping, graphics hardware, illumination, reflectance & shading models
15Evangelos Dermatas Direct Estimation of Polynomial Densities in Generalized RBF Networks Using Moments. Search on Bibsonomy ICANN The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Alexandre Sedoglavic A probabilistic algorithm to test local algebraic observability in polynomial time. Search on Bibsonomy ISSAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF seminumerical algorithm, observability, identifiability
15Nathan Linial, Alex Samorodnitsky, Avi Wigderson A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 90C27, 15A15, 15A12, 65B99, 90C30
15Victor Y. Pan Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding. Search on Bibsonomy ISSAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Dengwei Fu, Alan N. Willson Jr. Design of an improved interpolation filter using a trigonometric polynomial. Search on Bibsonomy ISCAS (4) The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
15Ravi Kumar 0001, D. Sivakumar 0001 Proofs, Codes, and Polynomial-Time Reducibilities. Search on Bibsonomy CCC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF reducibilities, proof systems, partial solutions
15Sanjeev Arora Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. Search on Bibsonomy J. ACM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF approximation algorithms, matching, traveling salesman problem, network design, Steiner problem
15Mikkel Thorup Map Graphs in Polynomial Time. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Javier Sánchez-Reyes The Symmetric Analogue of the Polynomial Power Basis. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Ball basis, Bernstein-Be´zier basis, monomial form, power basis, symmetric power, Hermite interpolation, degree reduction
15Gilles Brassard, Peter Høyer An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. Search on Bibsonomy ISTCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
15John Harrison 0001 Verifying the Accuracy of Polynomial Approximations in HOL. Search on Bibsonomy TPHOLs The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
15Jerzy Tyszkiewicz Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines (Extended Abstract). Search on Bibsonomy MFCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
15Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer 0001 Hyper-Polynomial Hierarchies and the NP-Jump. Search on Bibsonomy CCC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
15Klaus Ambos-Spies On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo When Polynomial Equation Systems Can Be "Solved" Fast?. Search on Bibsonomy AAECC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Jürgen Giesl Generating Polynomial Orderings for Termination Proofs. Search on Bibsonomy RTA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Dinesh Manocha Computing Selected Solutions of Polynomial Equations. Search on Bibsonomy ISSAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
15David A. Plaisted Polynomial Time Termination and Constraint Satisfaction Tests. Search on Bibsonomy RTA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
15Ketan Mulmuley A lOwer Bound for Solvability of Polynomial Equations. Search on Bibsonomy FSTTCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
15Victor Y. Pan New Resultant Inequalities and Complex Polynomial Factorization. Search on Bibsonomy ISTCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
15László Babai Deciding Finiteness of Matrix Groups in Las Vegas Polynomial Time. Search on Bibsonomy SODA The full citation details ... 1992 DBLP  BibTeX  RDF
15Adam Cichon, Pierre Lescanne Polynomial Interpretations and the Complexity of Algorithms. Search on Bibsonomy CADE The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
15Michael Kalkbrener Solving Systems of Bivariate Algebraic Equations by Using Primitive Polynomial Remainder Sequences. Search on Bibsonomy ISSAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
15Dieter Spreen On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. Search on Bibsonomy CSL The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
15José L. Balcázar, Ronald V. Book, Uwe Schöning The polynomial-time hierarchy and sparse oracles. Search on Bibsonomy J. ACM The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
15Guy Viry Polynomial Factorization over Z[x]. Search on Bibsonomy AAECC The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
15Alan L. Selman P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. Search on Bibsonomy ICALP The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
15Shimon Even, Robert Endre Tarjan A Combinatorial Problem Which Is Complete in Polynomial Space. Search on Bibsonomy J. ACM The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
14Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal New filtering algorithms for combinations of among constraints. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Domain consistency, Polynomial time filtering, Car sequencing, Regular constraint, Sequence constraint
14Huaping Chen 0002, Mingwang Zhang, Yuqin Zhao A Class of New Large-Update Primal-Dual Interior-Point Algorithms for Linear Complementarity Problems. Search on Bibsonomy ISNN (3) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Large-update method, P ???(?) LCPs, Finite kernel function, Interior-point algorithm, Polynomial complexity
14Foto N. Afrati, Phokion G. Kolaitis Repair checking in inconsistent databases: algorithms and complexity. Search on Bibsonomy ICDT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF coNP-complete problem, equality-generating dependencies, repair checking, tuple-generating dependencies, weakly acyclic set, polynomial time, consistent query answering, inconsistent databases, database repairs
14Noraliza Hamzah, Hanim Ismail, Zuhaina Zakaria The Application of Support Vector Machine in Classifying the Causes of Voltage Sag in Power System. Search on Bibsonomy RSKT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF voltage sag, support vector machine, radial basis function, polynomial, Power quality
14Yusuke Tanahashi, Ryohei Nakano Bidirectional Clustering of MLP Weights for Finding Nominally Conditioned Polynomials. Search on Bibsonomy ICANN (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF weight sharing, information criteria, rule extraction, multi-layer perceptron, polynomial regression
14Alin Bostan, Éric Schost Fast algorithms for differential equations in positive characteristic. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF p-curvature, algorithms, complexity, differential equations, polynomial solutions
14Shuji Kijima, Tomomi Matsui Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Fully polynomial-time randomized approximation scheme, Queueing network, Markov chain Monte Carlo, Perfect simulation, Product form solution
14Hadas Shachnai, Tami Tamir, Omer Yehezkely Approximation Schemes for Packing with Item Fragmentation. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Item fragmentation, Algorithms, Linear programming, Bin packing, Polynomial time approximation schemes
14Dan Trietsch, Kenneth R. Baker Minimizing the number of tardy jobs with stochastically-ordered processing times. Search on Bibsonomy J. Sched. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Sequencing, Polynomial algorithm, Stochastic scheduling
14Tobias Preusser, Hanno Scharr, Kai Krajsek, Robert M. Kirby Building Blocks for Computer Vision with Stochastic Partial Differential Equations. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Stochastic partial differential equations, Stochastic Galerkin method, Stochastic finite element method, Image processing, Error propagation, Random fields, Polynomial chaos
14Yun Guan, Jan Verschelde Parallel Implementation of a Subsystem-by-Subsystem Solver. Search on Bibsonomy HPCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF subsystem-by-subsystem solver, polynomial systems, homotopy continuation
14Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca A logical account of pspace. Search on Bibsonomy POPL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF type assignment, linear logic, implicit computational complexity, polynomial space
14Haining Fan, M. Anwar Hasan A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2007 DBLP  DOI  BibTeX  RDF subquadratic space complexity multiplier, shifted polynomial basis, Finite field, coordinate transformation, Toeplitz matrix
14Robert 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
14Jean-Philippe Aumasson, Matthieu Finiasz, Willi Meier, Serge Vaudenay TCHo: A Hardware-Oriented Trapdoor Cipher. Search on Bibsonomy ACISP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF hardware, linear feedback shift register, public-key cryptosystem, polynomial multiples, post-quantum cryptography
14Brian F. Redmond Multiplexor Categories and Models of Soft Linear Logic. Search on Bibsonomy LFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Categorical semantics, Soft Linear Logic, Polynomial time, Game semantics
14Wenqi Zhao, Guoliang Xu, Chandrajit L. Bajaj An algebraic spline model of molecular surfaces. Search on Bibsonomy Symposium on Solid and Physical Modeling The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Bernstein-Bezier basis, energetics, polynomial splines, prismatic scaffolds, solvation, error bounds, rate of convergence, molecular surfaces
14Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. Search on Bibsonomy SNC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multivariate rational function, random matrix, structured matrix, interpolation, probabilistic analysis, condition number, sparse polynomial, symbolic/numeric hybrid method
14Barry H. Dayton Numerical local rings and local solution of nonlinear systems. Search on Bibsonomy SNC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF analytic system, local ring, reduced row echelon form, polynomial system
14Martin E. Avendano, Teresa Krick, Ariel Pacetti Newton-Hensel Interpolation Lifting. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Newton-Hensel lifting, Adic integers, Sparse polynomial interpolation
14Salvador Lucas On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Polynomial orderings, Program analysis, Termination, Term rewriting
14Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Capacitated economic lot-sizing problem, Dynamic programming, Fully polynomial time approximation scheme
14Thang V. Pham, Arnold W. M. Smeulders Sparse Representation for Coarse and Fine Object Recognition. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF PCA, B-spline, multiscale, sparse representation, polynomial approximation, matching pursuit, Gaussian derivatives
14Xiaoliang Wan, George E. Karniadakis Beyond Wiener-Askey Expansions: Handling Arbitrary PDFs. Search on Bibsonomy J. Sci. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Uncertainty, stochastic differential equation, polynomial chaos
14Fatima Abu Salem A New Sparse Gaussian Elimination Algorithm and the Niederreiter Linear System for Trinomials over F2. Search on Bibsonomy Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Niederreiter algorithm, Finite fields, polynomial factorization, sparse Gaussian elimination
14Sylvie Boldo, César A. Muñoz Provably faithful evaluation of polynomials. Search on Bibsonomy SAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF formal verification, floating-point, polynomial evaluation
14Rainer Göttfert Sequences of Period 2N-2. Search on Bibsonomy SETA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Periodic sequences, nonlinear feedback shift registers, minimal polynomial
14Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz How to Sell a Graph: Guidelines for Graph Retailers. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Pricing problems, tollbooth problem, highway problem, computational complexity, dynamic programming, fully polynomial time approximation scheme
14Yassir Nawaz, Guang Gong, Kishan Chand Gupta Upper Bounds on Algebraic Immunity of Boolean Power Functions. Search on Bibsonomy FSE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Inverse exponent, Kasami exponent, Niho exponent, Algebraic attacks, Algebraic immunity, Power functions, Polynomial functions
14Jiejun Kong, Xiaoyan Hong, Mario Gerla Modeling Ad-hoc rushing attack in a negligibility-based security framework. Search on Bibsonomy Workshop on Wireless Security The full citation details ... 2006 DBLP  DOI  BibTeX  RDF asymptotic invariant, neg-ligibility, randomized network algorithms, randomized turing machine, sub-polynomial, scalability
14Jianqin Zhou, Qiang Zheng A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3). Search on Bibsonomy CANS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Cryptography, linear complexity, periodic sequence, minimal polynomial
14José-Alejandro Piñeiro, Stuart F. Oberman, Jean-Michel Muller, Javier D. Bruguera High-Speed Function Approximation Using a Minimax Quadratic Interpolator. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Table-based methods, minimax polynomial approximation, single-precision computations, computer arithmetic, square root, reciprocal, elementary functions
14Shao Chin Sung, Milan Vlach Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. Search on Bibsonomy J. Sched. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF just-in-time jobs, unrelated parallel machines, NP-hardness, polynomial time algorithm
14Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee Two Variations of the Minimum Steiner Problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time
14Liying Kang, T. C. Edwin Cheng, C. T. Ng 0001, Min Zhao Scheduling to Minimize Makespan with Time-Dependent Processing Times. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF fully polynomial approximation scheme, makespan, parallel machines scheduling
14Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF # P-completeness, NP-completeness, polynomial time algorithm, enumeration, independent set, Chordal graph, counting
14Marie-Christine Costa, Fethi Jarray, Christophe Picouleau Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. Search on Bibsonomy ICTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF alternate periodicity, polynomial time algorithm, discrete tomography, binary matrix
14Antoine Joux, Sébastien Kunz-Jacques, Frédéric Muller, Pierre-Michel Ricordel Cryptanalysis of the Tractable Rational Map Cryptosystem. Search on Bibsonomy Public Key Cryptography The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Tractable Rational Map Cryptosystem, XL, Gröbner Bases, Isomorphism of Polynomials, Public Key Cryptography, Polynomial Systems
14Ludovic Perret A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem. Search on Bibsonomy EUROCRYPT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Isomorphism of Polynomials with One Secret (IP1S), Polynomial Linear Equivalence (PLE), Cryptanalysis, Jacobian Matrix
14Mikhail Ju. Moshkov On Construction of the Set of Irreducible Partial Covers. Search on Bibsonomy SAGA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Irreducible partial cover, totally polynomial algorithm
14Berk Sunar, David Cyganski Comparison of Bit and Word Level Algorithms for Evaluating Unstructured Functions over Finite Rings. Search on Bibsonomy CHES The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Horner’s method, word level, finite fields, multivariate polynomials, polynomial evaluation
14Bok-Min Goi, Jintai Ding, Mohammad Umar Siddiqi Cryptanalysis of PASS II and MiniPass. Search on Bibsonomy ICICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF partial polynomial evaluation, cryptanalysis, digital signature scheme, NTRU, Authentication scheme
14Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson Adversarial contention resolution for simple channels. Search on Bibsonomy SPAA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF exponential backoff, polynomial backoff, worst-case backoff performance, on-line, batch
14Alan G. B. Lauder Counting Solutions to Equations in Many Variables over Finite Fields. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Homogeneous polynomial, Projective hypersurface, Dwork cohomology, Deformation theory, p-adic differentail equation, Algorithm, Finite field, Zeta function
14Sunyoung Kim, Masakazu Kojima Numerical Stability of Path Tracing in Polyhedral Homotopy Continuation Methods. Search on Bibsonomy Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF polyhedral homotopy continuation methods, numerical stability, Polynomial system, path tracing
14Xiaorong Hou, Xuemin Wang A Generalization of Xie-Nie Stability Criterion. Search on Bibsonomy IWMM/GIAE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Hurwitzean polynomial, stability criterion
14Markus Müller-Olm, Helmut Seidl Precise interprocedural analysis through linear algebra. Search on Bibsonomy POPL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF affine relation, polynomial relation, linear algebra, interprocedural analysis, weakest precondition
14Xiaotie Deng, Guojun Li A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Minimum congestion embedding hypergraph in a cycle, polynomial-time approximation scheme, computer application
14Jun Li 0005, Wei-Yun Yau Prediction of Fingerprint Orientation. Search on Bibsonomy ICPR (4) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF orientation prediction, fingerprint orientation, polynomial model, phase portrait model
14Gwénolé Ars, Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe, Makoto Sugita Comparison Between XL and Gröbner Basis Algorithms. Search on Bibsonomy ASIACRYPT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Multivariate polynomial equations, Solving Systems, Gröbner basis, Semi-regular Sequences, Algebraic attacks, XL algorithm
14Pavel Zahradnik, Miroslav Vlcek Fast Design of 2-D Narrow Bandstop FIR Filters for Image Enhancement. Search on Bibsonomy KES The full citation details ... 2004 DBLP  DOI  BibTeX  RDF bandstop filter, Zolotarev polynomial, equiripple approximation, FIR filter, two-dimensional
14Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong A Linear Systolic Array for Multiplication in GF(2m) for High Speed Cryptographic Processors. Search on Bibsonomy ICCSA (4) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Riemann Hypothesis, Artins conjecture for primitive roots, systolic array, Finite field multiplier, all one polynomial
14Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. Search on Bibsonomy ICCSA (3) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem
14Evelyne Hubert Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF differential elimination, differential ideal theory, subresultant polynomial remainder sequence, systems of differential equations, triangular sets
14Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi Approximate factorization of multivariate polynomials via differential equations. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximate gcd, multivariate gcd, multivariate polynomial factorization, symbolic numeric hybrid method, singular value decomposition, approximate factorization
14Jan Verschelde Numerical algebraic geometry and symbolic computation. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF irreducible decomposition, numerical homotopy continuation, polynomial systems, approximate factorization
14Didier Henrion, Jean B. Lasserre GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF SeDuMi, semidefinite programming, Matlab, linear matrix inequality, Polynomial programming
14Daniel Kobler, Udi Rotics Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Induced matching, Bull, Polynomial algorithms, Regular graphs, Line-graphs, Claw-free graphs
14Antonia W. Bluher On x6 + x + a in Characteristic Three. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF projective polynomial, accidental isomorphism, splitting field, Galois group, difference set
14Soonhak Kwon, Heuisu Ryu Efficient Bit Serial Multiplication in GF(2m) for a Class of Finite Fields. Search on Bibsonomy ICOIN The full citation details ... 2003 DBLP  DOI  BibTeX  RDF bit serial multiplication, optimal normal basis of type II, Finite field, dual basis, all one polynomial
Displaying result #701 - #800 of 28003 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][>>]
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