Search results for "polynomial"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
27	Markus Bläser, Holger Dell	Complexity of the Cover Polynomial.	ICALP	2007	DBLP DOI BibTeX RDF
27	Valentine Kabanets, Russell Impagliazzo	Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds.	Comput. Complex.	2004	DBLP DOI BibTeX RDF	68Q17, 68Q15, Subject classification. 68Q10
27	Nick Cropper, Ursula Martin	The Classification of Polynomial Orderings on Monadic Terms.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Termination, Term rewriting systems, Ordinals
27	Huapeng Wu	Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis.	CHES	1999	DBLP DOI BibTeX RDF
26	Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein	The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices	FOCS	1994	DBLP DOI BibTeX RDF	polynomial-sized encoding, membership problem complexity, 2-generated commutative semigroups, rational matrices, deterministic polynomial-time algorithm, ABC problem, 2-generated abelian linear groups, polynomial time algorithm, algebraic number field
26	Sivan Toledo	Maximizing Non-Linear Concave Functions in Fixed Dimension	FOCS	1992	DBLP DOI BibTeX RDF	parametric Euclidean traveling salesman problem, fixed dimension, piece wise polynomial concave function, concave polynomial, input point, nonlinear parametric problems, parametric max flow problem, parametric minimum s-t distance, parametric spanning tree, NP-hard problems, convex set, arithmetic operations, polynomial functions
26	Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan	Algebraic Methods for Interactive Proof Systems	FOCS	1990	DBLP DOI BibTeX RDF	polynomial value verification, program self correction, algebraic technique, program verification, language, interactive proof systems, program checking, polynomial-time hierarchy, low-degree polynomial
26	Bernard Chazelle, Joel Friedman	A Deterministic View of Random Sampling and its Use in Geometry	FOCS	1988	DBLP DOI BibTeX RDF	polynomial preprocessing, deterministic view, efficient probabilistic algorithms, polynomial overhead, probabilistic bounds, geometry complexity, simplicial packing, storage, polynomial time, random sampling, hypergraphs, divide-and-conquer, derandomized, hyperplanes
26	Xin Li 0009, Marc Moreno Maza, Wei Pan 0001	Computations modulo regular chains.	ISSAC	2009	DBLP DOI BibTeX RDF	fast polynomial arithmetic, regular chain, regular gcd, polynomial systems, triangular decomposition, subresultants
26	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
26	Erich L. Kaltofen, Pascal Koiran	Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields.	ISSAC	2006	DBLP DOI BibTeX RDF	Lang conjecture, lacunary polynomials, multivariate polynomials, polynomial-time complexity, polynomial factorization, sparse polynomials, height, algebraic numbers
26	Masakazu Kojima, Sunyoung Kim, Hayato Waki	Sparsity in sums of squares of polynomials.	Math. Program.	2005	DBLP DOI BibTeX RDF	Sums of squares of polynomial, Polynomial optimization problem, Semidefinite program, Sparsity
26	Charles E. Stroud, T. Raju Damarla	Improving the efficiency of error identification via signature analysis.	VTS	1995	DBLP DOI BibTeX RDF	error identification, single bit errors, input polynomial, least common multiple, diagnostic aliasing, multiple bit errors, nonprimitive polynomials, VLSI, VLSI, fault diagnosis, logic testing, built-in self test, integrated circuit testing, BIST, signature analysis, characteristic polynomial
26	Ivor P. Page, Tom Jacob, Eric Chern	Fast Algorithms for Distributed Resource Allocation.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	distributed static resource allocation problem, average case behavior, globalqueue, polynomial waiting time, polynomial message complexity, simulation, resource allocation, distributed processing, computationalcomplexity
26	David Fernández-Baca	Allocating Modules to Processors in a Distributed System.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	execution costs, P=NP, polynomial-time epsilon -approximate algorithm, optimum assignment, almost-tree, module allocation problem, distributed system, computational complexity, complexity, graph theory, distributed processing, iteration, polynomial time, planar, bipartite, partial k-tree, local search algorithm, communication graph
26	Stathis Zachos	A New Characterization of BPP.	FSTTCS	1984	DBLP DOI BibTeX RDF	Probalistic algorithms, polynomial time complexity classes, oracles, polynomial hierarchies
26	Thomas Eiter, Kazuhisa Makino	On computing all abductive explanations from a propositional Horn theory.	J. ACM	2007	DBLP DOI BibTeX RDF	Horn theories, dualization problem, polynomial total-time computation, NP-hardness, Abduction, model-based reasoning, propositional logic, tractability, prime implicates, characteristic set, enumeration algorithms
26	Vikram Sharma 0001	Complexity of real root isolation using continued fractions.	ISSAC	2007	DBLP DOI BibTeX RDF	Davenport-Mahler bound, descartes rule of signs, polynomial real root isolation, continued fractions
26	Kishan Chand Gupta, Subhamoy Maitra	Multiples of Primitive Polynomials over GF(2).	INDOCRYPT	2001	DBLP DOI BibTeX RDF	Cryptanalysis, Stream Cipher, Galois Field, Primitive Polynomials, Polynomial Multiples
26	Daniel Lokshtanov, Jesper Nederlof	Saving space by algebraization.	STOC	2010	DBLP DOI BibTeX RDF	moebius, dynamic programming, space efficient, fourier
26	Vikraman Arvind, Partha Mukhopadhyay	Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
25	Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen	Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.	CiE	2008	DBLP DOI BibTeX RDF	linear time complexity, static program analysis, polynomial time complexity, implicit computational complexity
24	Weiling Yang, Fuji Zhang	The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph.	CJCDGCGT	2005	DBLP DOI BibTeX RDF	Link diagram, Signed plane graph, Chain polynomial, Kauffman bracket polynomial
24	Igor Pak	The product replacement algorithm is polynomial.	FOCS	2000	DBLP DOI BibTeX RDF	product replacement algorithm, random group elements, generating /spl kappa/-tuples, random component, group algebra packages, MAGMA, state of the art analytic technique, polynomial bounds, sub exponential bounds, polynomial upper bound, heuristic, random walk, polynomials, random number generation, heuristic programming, symbol manipulation, group theory, graph connectivity, GAP
24	Sridhar Hannenhalli, Pavel A. Pevzner	Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem).	FOCS	1995	DBLP DOI BibTeX RDF	evolution (biological), duality (mathematics), genomic distance problem, human-mouse evolution, multi chromosomal genomes, duality theorem, computable parameters, combinatorial properties, parsimonious rearrangement scenarios, comparative physical mapping data, genome rearrangement algorithm, ZOO FISH, mammalian evolution, pattern matching, sorting, polynomial time algorithm, string matching, set theory, genetics, biology computing, strings, polynomial algorithm, genomic rearrangements
24	Guoqiang Ge	Testing Equalities of Multiplicative Representations in Polynomial Time (Extended Abstract)	FOCS	1993	DBLP DOI BibTeX RDF	deterministic polynomial time algorithm, testing equalities, nonzero elements, rational integers, polynomial time, multiplicative representations, algebraic number field
24	Dario Bini, Victor Y. Pan	Improved Parallel Polynomial Division and Its Extensions	FOCS	1992	DBLP DOI BibTeX RDF	stream contraction, parallel polynomial division, PRAM arithmetic models, triangular Toeplitz matrix, recursive processes, evaluation modulo, supereffective slowdown, parallel algebraic computations, polynomial, reciprocal, complexity estimates
24	Ilan Adler, Peter A. Beling	Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices	FOCS	1991	DBLP DOI BibTeX RDF	algebraic integers, subring, encoding size, bit size, Tardos scheme, strongly polynomial time, linear programming, interior point method, square roots, running time, polynomial algorithms, real numbers, circulant matrices
24	Sorin Istrail	Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	polynomial-size, generalized universal traversing sequences, polynomial size for graphs, small diameter, labeled undirected graphs, edge labels, derandomizations, finite automaton, space-bounded computation
24	Matthew Dickerson	The Inverse of an Automorphism in Polynomial Time	FOCS	1989	DBLP DOI BibTeX RDF	multivariate decomposition, K-algebra automorphism, commutative ring, polynomial decomposition algorithm, left composition factor, polynomial-time algorithm, inverse
24	Christoph Fünfzig, Dominique Michelucci, Sebti Foufou	Polytope-based computation of polynomial ranges.	SAC	2010	DBLP DOI BibTeX RDF	polynomial ranges, polytopes, multivariate polynomials, Bernstein polynomials
24	Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan	Bounding the average sensitivity and noise sensitivity of polynomial threshold functions.	STOC	2010	DBLP DOI BibTeX RDF	average sensitivity, boolean function, fourier analysis, noise sensitivity, polynomial threshold function
24	Grzegorz W. Wasilkowski, Henryk Wozniakowski	Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting.	Found. Comput. Math.	2009	DBLP DOI BibTeX RDF	Multivariate linear problems, Finite-order weights, Small effective dimension, Average case setting, Polynomial-time algorithms, Tractability
24	Eric J. Friedman	Finding a Simple Polytope from Its Graph in Polynomial Time.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Graph, Polynomial time, Polytope
24	Gérald Gavin, Marine Minier	Oblivious Multi-variate Polynomial Evaluation.	INDOCRYPT	2009	DBLP DOI BibTeX RDF	Homomorphic encryption schemes, Oblivious Polynomial Evaluation (OPE), semantic security
24	Suraj Sindia, Virendra Singh, Vishwani D. Agrawal	Polynomial coefficient based DC testing of non-linear analog circuits.	ACM Great Lakes Symposium on VLSI	2009	DBLP DOI BibTeX RDF	DC test, non-linear circuit test, polynomial, curve fitting, parametric faults
24	Gábor Ivanyos, Marek Karpinski, Nitin Saxena 0001	Schemes for deterministic polynomial factoring.	ISSAC	2009	DBLP DOI BibTeX RDF	grh, schemes, polynomial factoring, representation theory
24	Zhiguo Zhang 0001, Shing-Chow Chan, Ka-Leung Ho, K. C. Ho 0001	On Bandwidth Selection in Local Polynomial Regression Analysis and Its Application to Multi-resolution Analysis of Non-uniform Data.	J. Signal Process. Syst.	2008	DBLP DOI BibTeX RDF	adaptive bandwidth selection, intersection of confidence intervals, local polynomial regression, non-uniformly sampled data analysis, wavelet
24	Wan-Chun Ma, Andrew Jones 0001, Jen-Yuan Chiang, Tim Hawkins, Sune Frederiksen, Pieter Peers, Marko Vukovic, Ming Ouhyoung, Paul E. Debevec	Facial performance synthesis using deformation-driven polynomial displacement maps.	ACM Trans. Graph.	2008	DBLP DOI BibTeX RDF	facial performance synthesis, polynomial displacement maps
24	Aleksandar Peckov, Saso Dzeroski, Ljupco Todorovski	A Minimal Description Length Scheme for Polynomial Regression.	PAKDD	2008	DBLP DOI BibTeX RDF	minimal description length, regression, polynomial regression
24	Omran Ahmadi	The trace spectra of polynomial bases for F2n.	Appl. Algebra Eng. Commun. Comput.	2007	DBLP DOI BibTeX RDF	Polynomial bases, Finite fields, Irreducible polynomials
24	Sonia Pérez-Díaz, J. Rafael Sendra, Carlos Villarino	Finite piecewise polynomial parametrization of plane rational algebraic curves.	Appl. Algebra Eng. Commun. Comput.	2007	DBLP DOI BibTeX RDF	Piecewise polynomial parametrization, Rational algebraic curves, Error analysis
24	Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai, Shinji Hara	Parametric optimization in control using the sum of roots for parametric polynomial spectral factorization.	ISSAC	2007	DBLP DOI BibTeX RDF	Gröbner basis, polynomial spectral factorization, H2 control, sum of roots, quantifier elimination, parametric optimization
24	Huijian Han, Hui Liu, Xiuhua Ji	Interpolation to Data Points in Plane with Cubic Polynomial Precision.	Edutainment	2007	DBLP DOI BibTeX RDF	cubic polynomial, interpolation, parametrization
24	Vitaly Schetinin, Joachim Schult	Learning polynomial networks for classification of clinical electroencephalograms.	Soft Comput.	2006	DBLP DOI BibTeX RDF	Polynomial network, Group method of data handling, Classification, Electroencephalogram
24	Ding-Xuan Zhou, Kurt Jetter	Approximation with polynomial kernels and SVM classifiers.	Adv. Comput. Math.	2006	DBLP DOI BibTeX RDF	regularization scheme, polynomial kernel, approximation by Durrmeyer operators, support vector machine, classification algorithm, misclassification error
24	Songxin Liang, David J. Jeffrey	An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial.	AISC	2006	DBLP DOI BibTeX RDF	Complete discrimination system, complete root classification, root classification, parametric polynomial
24	Jae-Hun Jung, Bernie D. Shizgal	Inverse Polynomial Reconstruction of Two Dimensional Fourier Images.	J. Sci. Comput.	2005	DBLP DOI BibTeX RDF	Fourier approximation, Inverse polynomial reconstruction method, Two-dimensional image reconstruction, Shepp-Logan phantom image, Gibbs phenomenon
24	Maria Rosaria Capobianco, Woula Themistoclakis	Interpolating polynomial wavelets on [-1, 1].	Adv. Comput. Math.	2005	DBLP DOI BibTeX RDF	polynomial wavelets, de la Vallée Poussin means, fast discrete cosine and sine transforms, interpolation, Chebyshev 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	Huafei Zhu, Feng Bao 0001	Augmented Oblivious Polynomial Evaluation Protocol and Its Applications.	ESORICS	2005	DBLP DOI BibTeX RDF	Augmented oblivious polynomial evaluation, homomorphic commitment scheme, homomorphic public key encryption
24	Takayuki Gunji, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Katsuki Fujisawa, Tomohiko Mizutani	PHoM - a Polyhedral Homotopy Continuation Method for Polynomial Systems.	Computing	2004	DBLP DOI BibTeX RDF	homotopy continuation method, polyhedral homotopy, Polynomial, software package, equation, numerical experiment
24	Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt	Complexity issues in bivariate polynomial factorization.	ISSAC	2004	DBLP DOI BibTeX RDF	Hensel lifting, multi-moduli, tellegen, transposition principle, computer algebra, polynomial factorization
24	Weiqiang Lin, Mehmet A. Orgun, Graham J. Williams	Temporal Data Mining Using Hidden Markov-Local Polynomial Models.	PAKDD	2001	DBLP DOI BibTeX RDF	discrete-valued time series, similarity patterns, periodicity analysis, local polynomial modelling, hidden Markov models, temporal data mining
24	Michael M. Blane, Zhibin Lei, Hakan Çivi, David B. Cooper	The 3L Algorithm for Fitting Implicit Polynomial Curves and Surfaces to Data.	IEEE Trans. Pattern Anal. Mach. Intell.	2000	DBLP DOI BibTeX RDF	implicit polynomial representations, curve and surface fitting, fitting with constraints, algebraic curves and surfaces, Least-squares fitting
24	Deok-Soo Kim, Joonghyun Ryu, Hyun-Chan Lee, Hayong Shin, Joonyoung Park, Taeboom Jang	Fast Conversion of Dynamic B-Spline Curves into a Set of Power Form Polynomial Curves.	GMP	2000	DBLP DOI BibTeX RDF	power form, basis conversion, dynamic curve, polynomial, B-spline
24	Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi	Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract).	CCC	1999	DBLP DOI BibTeX RDF	counting principles, graph tautologies, algebraic proof systems, binomial proofs, Nullstellensatz proofs, polynomial calculus proofs, propositional logic, Proof complexity
24	Marc Moreno Maza, Renaud Rioboo	Polynomial Gcd Computations over Towers of Algebraic Extensions.	AAECC	1995	DBLP DOI BibTeX RDF	Polynomial gcd, zero dimensional systems, AXIOM, triangular sets, algebraic numbers, subresultants
24	Michael Unser, Akram Aldroubi, Murray Eden	The L2-Polynomial Spline Pyramid.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	signal approximation, parametric multiresolution signal representation, L/sub 2/-polynomial spline pyramid, REDUCE function, down-sampler, EXPAND function, up-sampler, post-filter, cubic spline pyramid, image processing, signal processing, signal processing, filtering and prediction theory, splines (mathematics), hierarchical data structure, linear filtering, prefilter, Laplacian pyramid
24	Charles Jerian, Ramesh C. Jain	Polynomial Methods for Structure from Motion.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	3D structure recovery, 2D image frames, MAXIMA, symbolic algebra system, Sturm sequences, pattern recognition, pattern recognition, picture processing, picture processing, structure from motion, polynomial, polynomials
24	Randall Dougherty, Christopher F. Freiling, Kenneth Zeger	Linear Network Codes and Systems of Polynomial Equations.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
24	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto	Computing the Tutte Polynomial in Vertex-Exponential Time.	FOCS	2008	DBLP DOI BibTeX RDF
24	Markus Bläser, Holger Dell, Johann A. Makowsky	Complexity of the Bollobás-Riordan Polynomial.	CSR	2008	DBLP DOI BibTeX RDF
24	Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon Meredith, Florian Enescu	Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors.	ICCAD	2007	DBLP DOI BibTeX RDF
24	Kenneth E. Barner, Tuncer C. Aysal	Polynomial weighted median filtering.	IEEE Trans. Signal Process.	2006	DBLP DOI BibTeX RDF
24	M. Chandrasekaran, M. Kalpana, R. S. D. Wahida Banu	Congestion Control Using Polynomial Window Size Adjustment Algorithms for Wired and Wireless TCP networks.	ICN/ICONS/MCL	2006	DBLP DOI BibTeX RDF
24	Jonathan Katz, Yehuda Lindell	Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.	TCC	2005	DBLP DOI BibTeX RDF
24	Farzad Parvaresh, Alexander Vardy	Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time.	FOCS	2005	DBLP DOI BibTeX RDF
24	Boaz Barak, Amit Sahai	How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation.	FOCS	2005	DBLP DOI BibTeX RDF
24	Enric Rodríguez-Carbonell, Deepak Kapur	An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants.	SAS	2004	DBLP DOI BibTeX RDF
24	Johannes Köbler, Wolfgang Lindner 0002	The Complexity of Learning Concept Classes with Polynomial General Dimension.	ALT	2002	DBLP DOI BibTeX RDF
24	Igor E. Shparlinski	Sparse polynomial approximation in finite fields.	STOC	2001	DBLP DOI BibTeX RDF	finite fields, exponential sums, sparse polynomials
24	Daniel Bleichenbacher, Phong Q. Nguyen	Noisy Polynomial Interpolation and Noisy Chinese Remaindering.	EUROCRYPT	2000	DBLP DOI BibTeX RDF
24	Charanjit S. Jutla	On Finding Small Solutions of Modular Multivariate Polynomial Equations.	EUROCRYPT	1998	DBLP DOI BibTeX RDF
24	Eugene V. Zima	Fast Parallel Computation of the Polynomial Shift.	IPPS	1997	DBLP DOI BibTeX RDF
24	Joachim von zur Gathen, Erich L. Kaltofen	Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields.	ICALP	1983	DBLP DOI BibTeX RDF
23	Erich L. Kaltofen, Pascal Koiran	On the complexity of factoring bivariate supersparse (Lacunary) polynomials.	ISSAC	2005	DBLP DOI BibTeX RDF	lacunary polynomials, NP-hardness, multivariate polynomials, polynomial-time complexity, polynomial factorizations, sparse polynomials
23	Victor Y. Pan	Randomized Acceleration of Fundamental Matrix Computations.	STACS	2002	DBLP DOI BibTeX RDF	Matrix determinant, minimum polynomial, Smith invariant factors, Frobenius invariant factors, bit-operation complexity, block Wiedemann algorithm, randomized algorithms, characteristic polynomial
23	Rodney G. Downey, André Nies	Undecidability Results for Low Complexity Degree Structures.	CCC	1997	DBLP DOI BibTeX RDF	undecidability results, low complexity degree structures, EXPTIME degrees, polynomial time Turing, many-one reducibility, coding method, ideal lattices, hyper-polynomial time classes, Boolean algebra, Boolean algebras
23	H. A. Almohamad, Salih O. Duffuaa	A Linear Programming Approach for the Weighted Graph Matching Problem.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	weighted graph matching, quadratic optimization, simplex-based algorithm, Hungarian method, symmetric polynomial transform, pattern recognition, computational complexity, computational complexity, linear programming, linear programming, polynomial time, eigendecomposition
23	Salvador Lucas	Practical use of polynomials over the reals in proofs of termination.	PPDP	2007	DBLP DOI BibTeX RDF	polynomial orderings, program analysis, termination, term rewriting
23	Bijan Bihari Misra, Suresh Chandra Satapathy, Pradipta K. Dash	Particle Swarm Optimized Polynomials for Data Classification.	ISDA (1)	2006	DBLP DOI BibTeX RDF	Polynomial Neural Network, Group Methods Of Data Handling, Particle Swarm Optimization
23	Bruno Codenotti, Benton McCune, Kasturi R. Varadarajan	Market equilibrium via the excess demand function.	STOC	2005	DBLP DOI BibTeX RDF	tâtonnement, algorithms, approximation, polynomial-time algorithms, market equilibrium
23	Thomas Eiter, Kazuhisa Makino	Abduction and the Dualization Problem.	Discovery Science	2003	DBLP DOI BibTeX RDF	monotone dualization, Horn functions, polynomial total-time computation, NP-hardness, Abduction, model-based reasoning, hypergraph transversals
23	Jean-Philippe Tarel, David B. Cooper	The Complex Representation of Algebraic Curves and Its Simple Exploitation for Pose Estimation and Invariant Recognition.	IEEE Trans. Pattern Anal. Mach. Intell.	2000	DBLP DOI BibTeX RDF	Complex polynomials, pose-independent curve recognition, Euclidean invariants, complete-sets of rotation invariants, curve centers, implicit polynomial curves, pose estimation, shape representation, shape recognition, algebraic curves
23	Manindra Agrawal, Somenath Biswas	Primality and Identity Testing via Chinese Remaindering.	FOCS	1999	DBLP DOI BibTeX RDF	Primality testing, Polynomial identity testing
23	Jovisa D. Zunic, Dragan M. Acketa	Least squares fitting of digital polynominal segments.	DGCI	1996	DBLP DOI BibTeX RDF	digital polynomial segment, computer vision, Image processing, coding, least squares fitting
23	Patrick Fitzpatrick, Graham H. Norton	The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain.	Appl. Algebra Eng. Commun. Comput.	1995	DBLP DOI BibTeX RDF	Polynomial remainder sequence, linear recurring sequence, factorial domain, Berlekamp-Massey algorithm
23	Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran	An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras.	RTA	1985	DBLP DOI BibTeX RDF	Unification Problem, Finitely Presented Algebras, Commutative Algebras, Gröbner Basis, Knuth-Bendix Completion Procedure, Term Rewriting, Word Problem, Polynomial Ideals
23	Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar	Linkless and flat embeddings in 3-space and the unknot problem.	SCG	2010	DBLP DOI BibTeX RDF	flat embedding, linkless embedding, unknot, knot
23	Michael Dom, Daniel Lokshtanov, Saket Saurabh 0001	Incompressibility through Colors and IDs.	ICALP (1)	2009	DBLP DOI BibTeX RDF
23	Parikshit Gopalan, Subhash Khot, Rishi Saket	Hardness of Reconstructing Multivariate Polynomials over Finite Fields.	FOCS	2007	DBLP DOI BibTeX RDF
23	Arfst Nickelsen, Birgit Schelm	Average-Case Computations - Comparing AvgP, HP, and Nearly-P.	CCC	2005	DBLP DOI BibTeX RDF
23	Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman	On Using Oracles That Compute Values.	STACS	1993	DBLP DOI BibTeX RDF
22	Hiroki Arimura, Takeaki Uno	A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence.	ISAAC	2005	DBLP DOI BibTeX RDF
21	Martin Byröd, Klas Josephson, Kalle Åström	Fast and Stable Polynomial Equation Solving and Its Application to Computer Vision.	Int. J. Comput. Vis.	2009	DBLP DOI BibTeX RDF	Gröbner basis, Structure from motion, Polynomial equations, Minimal problems
21	Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos	The Longest Path Problem Is Polynomial on Interval Graphs.	MFCS	2009	DBLP DOI BibTeX RDF	Longest path problem, complexity, dynamic programming, interval graphs, polynomial algorithm
21	Robert Ganian, Petr Hlinený	Better Polynomial Algorithms on Graphs of Bounded Rank-Width.	IWOCA	2009	DBLP DOI BibTeX RDF	Rank-width, rank-decomposition, chromatic polynomial, Hamiltonian path, chromatic number
21	Alexey S. Rodionov, Olga K. Rodionova, Hyunseung Choo	Using Meaning of Coefficients of the Reliability Polynomial for Their Faster Calculation.	ICCSA (2)	2009	DBLP DOI BibTeX RDF	reliability polynomial, factoring method
21	Maris Tõnso, Ülle Kotta	Realization of Continuous-Time Nonlinear Input-Output Equations: Polynomial Approach.	EUROCAST	2009	DBLP DOI BibTeX RDF	input-output models, polynomial methods, state space realization, nonlinear control system, continuous-time system