Search results for "polynomial"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Hans L. Bodlaender, Udi Rotics	Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition.	Algorithmica	2003	DBLP DOI BibTeX RDF	Minimum fill-in, Minimal separators, Graph algorithms, Treewidth, Polynomial algorithms, Modular decomposition
17	Manindra Agrawal, Somenath Biswas	Primality and identity testing via Chinese remaindering.	J. ACM	2003	DBLP DOI BibTeX RDF	Primality testing, polynomial identity testing
17	Han-Saem Yun, Jihong Kim 0001	On energy-optimal voltage scheduling for fixed-priority hard real-time systems.	ACM Trans. Embed. Comput. Syst.	2003	DBLP DOI BibTeX RDF	real-time systems, approximation algorithms, dynamic voltage scaling, Fixed-priority scheduling, fully polynomial time approximation scheme, variable voltage processor
17	Zhenhong Liu, Jianzhong Zhang 0001	On Inverse Problems of Optimum Perfect Matching.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	maximum-mean alternating cycle, ellipsoid method, linear programming, perfect matching, strongly polynomial algorithm, maximum-weight matching
17	Marcus Schaefer 0001, Frank Stephan 0001	Strong Reductions and Immunity for Exponential Time.	STACS	2003	DBLP DOI BibTeX RDF	hardness for exponential time, polynomial time reducibilities, Computational and structural complexity
17	Li Chen 0002, Paul P. Wang	Fuzzy relation equations (I): the general and specialized solving algorithms.	Soft Comput.	2002	DBLP DOI BibTeX RDF	Polynomial time problem, N P -hard problem, Algorithm, Fuzzy relation equation
17	Thomas Eiter, Georg Gottlob, Kazuhisa Makino	New results on monotone dualization and generating hypergraph transversals.	STOC	2002	DBLP DOI BibTeX RDF	combinatorial enumeration, hypergraph acyclicity, limited nondeterminism, output-polynomial algorithms, transversal computation, treewidth, dualization
17	Peter A. Beling	Exact Algorithms for Linear Programming over Algebraic Extensions.	Algorithmica	2001	DBLP DOI BibTeX RDF	Ellipsoid method, Computational complexity, Linear programming, Polynomial-time algorithms, Symbolic computation, Algebraic numbers
17	Bruce M. Maggs, Berthold Vöcking	Improved Routing and Sorting on Multibutterflies.	Algorithmica	2000	DBLP DOI BibTeX RDF	Ellipsoid method, Computational complexity, Linear programming, Polynomial-time algorithms, Symbolic computation, Algebraic numbers
17	Sanjeev Arora	Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems.	FOCS	1997	DBLP DOI BibTeX RDF	randomized polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, nearly-linear time approximation, randomized, Steiner Tree, parallel implementations, randomised algorithms, geometric problems
17	Maren Hinrichs, Gerd Wechsung	Time Bounded Frequency Computations.	CCC	1997	DBLP DOI BibTeX RDF	Frequency Computation, Hierarchy of frequency classes under polynomial time bounds, Complexity Theory
17	Theodora A. Varvarigou, Vwani P. Roychowdhury, Thomas Kailath, Eugene L. Lawler	Scheduling In and Out Forests in the Presence of Communication Delays.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	out-forest precedence graphs, out-forest precedence graphs, optimal deterministic schedules, polynomial-time algorithms, Communication delays, multiprocessor architectures
17	Shashidhar Thakur, D. F. Wong 0001	Simultaneous area and delay minimum K-LUT mapping for K-exact networks.	ICCD	1995	DBLP DOI BibTeX RDF	area/delay minimum K-LUT mapping, K-exact networks, technology mapping problem, lookup table FPGAs, area minimization problem, K-bounded networks, delay minimization problem, flow-map algorithm, field programmable gate arrays, computational complexity, complexity, NP-complete, logic design, polynomial time algorithm, programmable logic arrays, table lookup, minimisation of switching nets
17	Dana Angluin, Lisa Hellerstein, Marek Karpinski	Learning Read-Once Formulas with Queries.	J. ACM	1993	DBLP DOI BibTeX RDF	?-formulas, exact identification, polynomial-time learning, read-once formulas, interpolation, membership queries, equivalence queries
17	Paul Dagum, R. Martin Chavez	Approximating Probabilistic Inference in Bayesian Belief Networks.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	probabilistic inference approximation, stochastic simulation algorithm, D-BNRAS, reasoning, polynomial, polynomials, inference mechanisms, Bayes methods, Bayesian belief networks, uncertainty handling, conditional probabilities, probabilistic logic, belief maintenance
17	Ilan Sadeh, Amir Averbuch	Bounds on Parallel Computation of Multivariate Polynomials.	ISTCS	1992	DBLP DOI BibTeX RDF	Complexity of parallel computation, Design and analysis of parallel algorithms, Maximal-degree, Dense polynomial, Multivariate polynomials
17	Judith F. Silverman, David B. Cooper	Bayesian Clustering for Unsupervised Estimation of Surface and Texture Models.	IEEE Trans. Pattern Anal. Mach. Intell.	1988	DBLP DOI BibTeX RDF	unsupervised parameter estimation, Bayesian clustering, maximum-likelihood clustering, polynomial models, segmentation, Markov processes, computerised picture processing, computerised picture processing, computerised pattern recognition, computerised pattern recognition, polynomials, Bayes methods, surface models, texture models, depth map, agglomerative clustering, Gaussian-Markov random field
17	Pavel Hrubes, Avi Wigderson, Amir Yehudayoff	Non-commutative circuits and the sum-of-squares problem.	STOC	2010	DBLP DOI BibTeX RDF	lower bounds, algebraic complexity
17	Dániel Marx	Approximating fractional hypertree width.	SODA	2009	DBLP DOI BibTeX RDF
17	Ran Raz, Iddo Tzameret	The Strength of Multilinear Proofs.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification. 03F20, 68Q17, 13P10
17	L. Yohanes Stefanus	Surface representations using blossoms and buds.	Shape Modeling International	2008	DBLP DOI BibTeX RDF
17	Dang Hoai Bac, Nguyen Binh, Nguyen Xuan Quynh	Novel Algebraic Structure for Cyclic Codes.	AAECC	2007	DBLP DOI BibTeX RDF
17	Adam R. Klivans, Alexander A. Sherstov	Cryptographic Hardness for Learning Intersections of Halfspaces.	FOCS	2006	DBLP DOI BibTeX RDF
17	Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin	Computing Graph Polynomials on Graphs of Bounded Clique-Width.	WG	2006	DBLP DOI BibTeX RDF
17	L. Yohanes Stefanus	Shape Representations with Blossoms and Buds.	GMP	2006	DBLP DOI BibTeX RDF
17	Yuhan Cai, Raymond T. Ng	Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials. (PDF / PS)	SIGMOD Conference	2004	DBLP DOI BibTeX RDF
17	John M. Hitchcock	Small Spans in Scaled Dimension.	CCC	2004	DBLP DOI BibTeX RDF
17	Adam R. Klivans, Amir Shpilka	Learning Arithmetic Circuits via Partial Derivatives.	COLT	2003	DBLP DOI BibTeX RDF	learning with queries, PAC learning
17	Lisa Fleischer, Martin Skutella	The Quickest Multicommodity Flow Problem.	IPCO	2002	DBLP DOI BibTeX RDF
17	Kosaku Nagasaka	Towards certified irreducibility testing of bivariate approximate polynomials.	ISSAC	2002	DBLP DOI BibTeX RDF
17	Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner	The Complexity of Computing the Size of an Interval.	ICALP	2001	DBLP DOI BibTeX RDF
17	Ernst W. Mayr	In Is on the Boundary: Complexity Considerations for Polynominal Ideals.	IFIP TCS	2000	DBLP DOI BibTeX RDF
17	Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon	Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract).	COLT	1994	DBLP DOI BibTeX RDF
17	Juan Llovet, J. Rafael Sendra	A Modular Approach to the Computation of the Number of Real Roots.	ISSAC	1990	DBLP DOI BibTeX RDF
17	Philippe Toffin, Marc Girault, Brigitte Vallée	How to Guess l-th Roots Modulo n by Reducing Lattice Bases.	AAECC	1988	DBLP DOI BibTeX RDF
17	Volker Weispfenning	Some Bounds for the Construction of Gröbner Bases.	AAECC	1986	DBLP DOI BibTeX RDF
15	Bo Zheng 0001, Jun Takamatsu, Katsushi Ikeuchi	An Adaptive and Stable Method for Fitting Implicit Polynomial Curves and Surfaces.	IEEE Trans. Pattern Anal. Mach. Intell.	2010	DBLP DOI BibTeX RDF	Fitting algebraic curves and surfaces, implicit shape representation, implicit polynomial (IP)
15	Bastian Laubner	Capturing Polynomial Time on Interval Graphs.	LICS	2010	DBLP DOI BibTeX RDF	capturing of polynomial time, fixed-point logic with counting, interval graphs, canonical forms, modular decomposition
15	Cheng-Hsiung Hsieh, Sheng-Yung Hung, Chia-Wei Lan, Po-Chin Huang	Impulse Noise Removal Based on Grey Polynomial Interpolation.	ITNG	2010	DBLP DOI BibTeX RDF	grey polynomial interpolation, median filtering, impulse noise removal
15	Xuli Han	Shape Representation of Polynomial Curves with Adjustable Interpolation Points.	Shape Modeling International	2010	DBLP DOI BibTeX RDF	polynomial curve, interpolation curve, shape parameter, B-spline curve
15	Suraj Sindia, Virendra Singh, Vishwani D. Agrawal	Parametric Fault Diagnosis of Nonlinear Analog Circuits Using Polynomial Coefficients.	VLSI Design	2010	DBLP DOI BibTeX RDF	polynomial coefficients, fault diagnosis, sensitivity, nonlinear circuits
15	Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan	A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions.	CCC	2010	DBLP DOI BibTeX RDF	Boolean function, regularity lemma, polynomial threshold function
15	Per Olov Lindberg, Lars Svensson	Gröbner Bases for Polynomial Equations.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Gröbner basis, Zeros, Polynomial equations
15	Mathieu Allard, Patrick Grogan, Jean-Pierre David	A Scalable Architecture for Multivariate Polynomial Evaluation on FPGA.	ReConFig	2009	DBLP DOI BibTeX RDF	High performance computing, ASIP, multivariate, Polynomial evaluation
15	Rafael A. Arce-Nazario, Edusmildo Orozco, Dorothy Bollman	A Systolic Array Based Architecture for Implementing Multivariate Polynomial Interpolation Tasks.	ReConFig	2009	DBLP DOI BibTeX RDF	multivariate polynomial interpolation, parameterizable architectures, bioinformatic applications, reverse engineering problem for gene networks, systolic arrays
15	Saugata Basu, Thierry Zell	Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem.	FOCS	2009	DBLP DOI BibTeX RDF	Toda's theorem, Betti numbers, Polynomial hierarchy, Semi-algebraic sets
15	Miroslav Halás	Nonlinear Systems: A Polynomial Approach.	EUROCAST	2009	DBLP DOI BibTeX RDF	polynomial approach, transfer functions, nonlinear systems, algebraic approach
15	Michael B. Monagan, Roman Pearce	Parallel sparse polynomial multiplication using heaps.	ISSAC	2009	DBLP DOI BibTeX RDF	parallel, polynomial, multiplication, sparse
15	Daniel S. Roche	Space- and time-efficient polynomial multiplication.	ISSAC	2009	DBLP DOI BibTeX RDF	time-space tradeoff, polynomial multiplication, integer multiplication, space efficiency
15	Guang Zeng, Yang Yang, Wenbao Han, Shuqin Fan	Reducible Polynomial over F2 Constructed by Trinomial sigma-LFSR.	Inscrypt	2008	DBLP DOI BibTeX RDF	Stickelberger-Swan Theorem, ??LFSR, Finite Field, Linear Feedback Shift Register(LFSR), Irreducible Polynomial
15	Farshid Delgosha, Erman Ayday, Faramarz Fekri	MKPS: a multivariate polynomial scheme for symmetric key-establishment in distributed sensor networks.	IWCMC	2007	DBLP DOI BibTeX RDF	wireless sensor network, location-aware, multivariate polynomial, key pre-distribution
15	Robert M. Corless, Nargol Rezvani	The nearest polynomial of lower degree.	SNC	2007	DBLP DOI BibTeX RDF	lagrange basis, nearest polynomial, CAGD
15	Marco Bodrato, Alberto Zanoni	Integer and polynomial multiplication: towards optimal toom-cook matrices.	ISSAC	2007	DBLP DOI BibTeX RDF	Karatsuba, integer and polynomial multiplication, toom-cook, interpolation, squaring, matrix inversion
15	Chengbin Chu	A faster polynomial algorithm for 2-cyclic robotic scheduling.	J. Sched.	2006	DBLP DOI BibTeX RDF	Hoist scheduling, No-wait flowshop, Complexity, Polynomial algorithm, Cyclic scheduling
15	Joachim von zur Gathen	Who was who in polynomial factorization: 1.	ISSAC	2006	DBLP DOI BibTeX RDF	history, polynomial factorization
15	Xiao-Shan Gao, Chun-Ming Yuan	Resolvent systems of difference polynomial ideals.	ISSAC	2006	DBLP DOI BibTeX RDF	difference ascending chain, difference polynomial, difference variety, unmixed decomposition, resolvent
15	Sylvain Maire	Polynomial approximations of multivariate smooth functions from quasi-random data.	Stat. Comput.	2004	DBLP DOI BibTeX RDF	iterative Monte Carlo algorithm, quasi-random sequences, numerical integration, polynomial approximations
15	Shai Dekel, Dany Leviatan	Whitney Estimates for Convex Domains with Applications to Multivariate Piecewise Polynomial Approximation.	Found. Comput. Math.	2004	DBLP DOI BibTeX RDF	Piecewise polynomial approximation, Whitney estimates, Johns theorem, Nonlinear approximation
15	Erol Yilmaz, Sibel Kiliçarslan	Minimal Homogeneous Bases for Polynomial Ideals.	Appl. Algebra Eng. Commun. Comput.	2004	DBLP DOI BibTeX RDF	Gröbner bases, Syzygies, Polynomial ideals
15	Stefanie Hahmann, Georges-Pierre Bonneau	Polynomial Surfaces Interpolating Arbitrary Triangulations.	IEEE Trans. Vis. Comput. Graph.	2003	DBLP DOI BibTeX RDF	irregular 3D meshes, piecewise polynomial patches, arbitrary tangent vectors, modeling, interpolation, reconstruction, Triangulation, surfaces, arbitrary topology, triangular patches
15	Vítezslav Svejdar	On the polynomial-space completeness of intuitionistic propositional logic.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF	Logical connectives, Intuitionistic logic, Decision problem, Non-classical logics, Kripke models, Polynomial-space
15	Ryan O'Donnell, Rocco A. Servedio	New degree bounds for polynomial threshold functions.	STOC	2003	DBLP DOI BibTeX RDF	ptfs, learning, lower bounds, polynomials, duality, degree, formulas, polynomial threshold functions
15	M. Jardak, Chau-Hsing Su, George E. Karniadakis	Spectral Polynomial Chaos Solutions of the Stochastic Advection Equation.	J. Sci. Comput.	2002	DBLP DOI BibTeX RDF	Wiener-Hermite expansions, uncertainty, stochastic differential equations, polynomial chaos
15	Rafail Ostrovsky, Yuval Rabani	Polynomial Time Approximation Schemes for Geometric k-Clustering.	FOCS	2000	DBLP DOI BibTeX RDF	geometric k-clustering, data point clustering, data set partitioning, high dimensional geometry, binary cube, computational complexity, computational geometry, Hamming distance, NP-hard problem, distance function, polynomial time approximation schemes, pattern clustering, k-median problem
15	Franz Pauer, Andreas Unterkircher	Gröbner Bases for Ideals in Laurent Polynomial Rings and their Application to Systems of Difference Equations.	Appl. Algebra Eng. Commun. Comput.	1999	DBLP DOI BibTeX RDF	Laurent polynomial ring, generalized term order, partial difference equation, groebner basis
15	Bogdan J. Falkowski	A Note on the Polynomial Form of Boolean Functions and Related Topics.	IEEE Trans. Computers	1999	DBLP DOI BibTeX RDF	polynomial forms, arithmetic transform, mixed arithmetic transform, arithmetic derivatives, Boolean functions, multiple-valued functions
15	James B. Orlin	A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract).	SODA	1996	DBLP DOI BibTeX RDF	network simplex, premultipliers, polynomial time, simplex algorithm, Minimum cost flows
15	Sanjeev Arora	Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems.	FOCS	1996	DBLP DOI BibTeX RDF	polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, k-TSP, Minimum degree-k, k-MST, computational geometry, spanning tree, Steiner Tree, best approximation, geometric problems
15	Martin Grohe	Equivalence in Finite-Variable Logics is Complete for Polynomial Time.	FOCS	1996	DBLP DOI BibTeX RDF	finite-variable logics, finite structures, graph isomorphism problem, complexity theoretic difficulties, quantifier-free reductions, completeness result, counting quantifiers, computational complexity, first order logic, polynomial time, equivalence
15	Ming-Deh A. Huang, Yiu-Chung Wong	Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract).	FOCS	1996	DBLP DOI BibTeX RDF	polynomial congruences, algebraic homotopy method, algebraic set, computational complexity, randomized algorithm, decision, parallel complexity
15	Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala	A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions.	FOCS	1996	DBLP DOI BibTeX RDF	noisy linear threshold function learning, ellipsoid algorithm, separation parameter, input description length, weak hypothesis finding, random classification noise, data outlier removal, learning (artificial intelligence), linear program, polynomial-time algorithm, greedy algorithms, noise tolerance, perceptron algorithm, PAC model
15	F. Locher, Michael-Ralf Skrzipek	An Algorithm for Locating All Zeros of a Real Polynomial.	Computing	1995	DBLP DOI BibTeX RDF	Eulidean division of Chebyshev expansions, Sturm sequences, Polynomial zeros
15	C. R. Subramanian 0001	Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time.	FOCS	1995	DBLP DOI BibTeX RDF	minimum coloring random graphs, semi-random graphs, polynomial expected time, k-coloring, worst-case model, computational complexity, graph theory, vertices, graph colouring
15	Piera Barcaccia, Maurizio A. Bonuccelli	Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems.	IEEE/ACM Trans. Netw.	1994	DBLP DOI BibTeX RDF	variable bandwidth switching system, combinatorial optimization, polynomial time algorithm, network flow
15	Gueesang Lee, Mary Jane Irwin, Robert Michael Owens	Polynomial Time Testability of Circuits Generated by Input Decomposition.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	input decomposition, logic synthesis tool, fault detection problem, complexity, logic testing, test generation, combinational circuits, logic CAD, testability, stuck-at fault, polynomial time, combinatorial circuits
15	Yoram Hirshfeld, Mark Jerrum, Faron Moller	A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes	FOCS	1994	DBLP DOI BibTeX RDF	normed context-free processes, language equivalence, polynomial-time algorithm, decidability, equivalence, context-free grammars, bisimilarity
15	Ravi Kannan	Markov Chains and Polynomial Time Algorithms	FOCS	1994	DBLP DOI BibTeX RDF	approximately certain, Markov Chains, randomized algorithms, polynomial time algorithms, perfect matchings, counting problems
15	Edith Cohen, Nimrod Megiddo	Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs.	J. ACM	1993	DBLP DOI BibTeX RDF	application of multidimensional search, application of parametric method, strongly polynomial algorithms periodic graphs
15	Shu Tezuka	Polynomial Arithmetic Analogue of Halton Sequences.	ACM Trans. Model. Comput. Simul.	1993	DBLP DOI BibTeX RDF	Halton sequences, Niederreiter sequences, polynomial arithmetic over finite fields, discrepancy
15	Richa Agarwala, David Fernández-Baca	A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed	FOCS	1993	DBLP DOI BibTeX RDF	perfect phylogeny problem, character states, NP-complete, polynomial-time algorithm
15	Alexander I. Barvinok	A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed	FOCS	1993	DBLP DOI BibTeX RDF	d-dimensional Euclidean space, integral points counting, polynomial time algorithm, polyhedra
15	Victor Y. Pan, John H. Reif, Stephen R. Tate	The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms	FOCS	1992	DBLP DOI BibTeX RDF	algebraic computation, multipoint polynomial evaluation, multipole algorithms, complexity, numerical computing
15	Sam M. Kim, Robert McNaughton, Robert McCloskey	A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	local testability, locally testable language, nonnegative integer, prefix, suffix, computational complexity, polynomial time algorithm, formal languages, finite automata, word, deterministic finite automata, deterministic automata, substrings
15	Irith Pomeranz, Zvi Kohavi	Polynomial Complexity Algorithms for Increasing the Testability of Digital Circuits by Testing Module Insertion.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	polynomial complexity algorithms, testing-module insertion, test set merging, fanout free circuits, computational complexity, logic testing, partitioning, combinational circuits, logic CAD, testability, digital circuits, combinatorial circuits, single stuck-at faults, test generation algorithm, placement algorithm
15	Bruce M. Kapron, Stephen A. Cook	A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	polytime operators, Mehlhorn's polynomial time functionals, machine-independent characterization, computational feasibility, type 2 functionals, feasibility, inductive definition
15	Johannes Blömer	Computing Sums of Radicals in Polynomial Time	FOCS	1991	DBLP DOI BibTeX RDF	positive rational integer, probabilistic checking, sums of radicals, coefficient representation, subalgorithm, real algebraic number field, polynomial time algorithm, decidability, Monte Carlo algorithm
15	Victor Shoup, Roman Smolensky	Lower Bounds for Polynomial Evaluation and Interpolation Problems	FOCS	1991	DBLP DOI BibTeX RDF	interpolation problems, algebraic program, lower bound, polynomial evaluation
15	Praxetes Canutes Mathias, Lalit M. Patnaik	Systolic Evaluation of Polynomial Expressions.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	systolic evaluation, polynomial expressions, frame buffers, single wavefront complex cell array, multiple wavefront array, VLSI, computer graphics, computer graphics, interconnection, polynomials, cellular arrays, VLSI implementation
15	Jehoshua Bruck, Roman Smolensky	Polynomial Threshold Functions, AC^0 Functions and Spectral Norms (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	spectral representation, AC functions, spectrum norms, Boolean function, harmonic analysis, polynomial-threshold functions
15	Baruch Awerbuch, Michael E. Saks	A Dining Philosophers Algorithm with Polynomial Response Time	FOCS	1990	DBLP DOI BibTeX RDF	dynamic job creation, job arrival density, conflicting jobs, asynchronous model, concurrent jobs, maximum execution time, dining philosophers algorithm, polynomial response time, distributed online algorithm, message transmission time, resource allocation, upper bound, job scheduling, resource constraints, resource requirements, arbitrary networks, distribution queue
15	C. Andrew Neff	Specified Precision Polynomial Root Isolation is in NC	FOCS	1990	DBLP DOI BibTeX RDF	parallel time complexity, polynomial root isolation, parallel complexity class NC, error, precision
15	Jyh-Charn Liu, Kang G. Shin	Polynomial Testing of Packet Switching Networks.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	polynomial testing, multiple stuck-at fault model, functional testing method, network level, switch level, network-level testing, built-in tester, multiprocessor interconnection networks, packet switching, multiprocessor systems, automatic testing, polynomials, multistage interconnection networks, packet switching networks, routing dynamic
15	Russell Impagliazzo, Gábor Tardos	Decision Versus Search Problems in Super-Polynomial Time	FOCS	1989	DBLP DOI BibTeX RDF	X-search problem, super-polynomial time, decidable, search problems, decision problems, parallel complexity
15	Stephen A. Fenner, Stuart A. Kurtz, James S. Royer	Every Polynomial-Time 1-Degree Collapses iff P=PSPACE	FOCS	1989	DBLP DOI BibTeX RDF	equivalent sets, m-reducible, Karp-reducible, polynomial-time computable function
15	Leonid A. Levin	Homogeneous Measures and Polynomial Time Invariants	FOCS	1988	DBLP DOI BibTeX RDF	pseudorandom strings, homogeneous measures, polynomial time invariants, average case NP-completeness, Kolmogorov complexity, probability distributions
15	Yoram Moses, Orli Waarts	Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time	FOCS	1988	DBLP DOI BibTeX RDF	coordinated traversal, arbitrarily malicious failures, protocol, polynomial time, Byzantine agreement, fault masking
15	Olivier Goldschmidt, Dorit S. Hochbaum	Polynomial Algorithm for the k-Cut Problem	FOCS	1988	DBLP DOI BibTeX RDF	k-cut problem, edge weighted graph, k nonempty components, total edge weight, partition, NP-complete, NP hard, polynomial algorithm, vertex
15	Trieu-Kien Truong, Kuang Y. Liu, Irving S. Reed	A Parallel-Pipeline Architecutre of the Fast Polynomial Transform for Computing a Two-Dimensional Cyclic Convolution.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	fast polynomial transform, FFT butterfly, pipeline, Cyclic convolution
15	Gradimir V. Milovanovic, Miodrag S. Petkovic	On the convergence order of a modified method for simultaneous finding polynomial zeros.	Computing	1983	DBLP DOI BibTeX RDF	Determination of polynomial zeros, simultaneous iterative methods, accelerated convergence, R-order of convergence
15	Deok Kyo Lee	Method of Folding a Piecewise Polynomial Function in the Delta Function Integral Representation.	IEEE Trans. Computers	1978	DBLP DOI BibTeX RDF	piecewise polynomial function, delta function integral, convolution, Autocorrelation