Search results for "polynomial"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
14	Erich L. Kaltofen, John P. May	On approximate irreducibility of polynomials in several variables.	ISSAC	2003	DBLP DOI BibTeX RDF	absolute irreducibility, effective Noether irreducibility forms, multivariate polynomial factorization, radius of irreducibility, approximate factorization, symbolic/numeric hybrid method
14	Dimitris Fotakis 0001, Paul G. Spirakis	Minimum Congestion Redundant Assignments to Tolerate Random Faults.	Algorithmica	2002	DBLP DOI BibTeX RDF	Redundant assignments, Fault-tolerance, Polynomial-time approximation algorithms
14	Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger	More about Subcolorings.	WG	2002	DBLP DOI BibTeX RDF	subcoloring, special graph classes, computational complexity, graph coloring, polynomial time algorithm
14	Soonhak Kwon	Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields.	ICICS	2002	DBLP DOI BibTeX RDF	systolic multiplier, finite field, basis, all one polynomial
14	Rastko Zivanovic	Local Regression-Based Short-Term Load Forecasting.	J. Intell. Robotic Syst.	2001	DBLP DOI BibTeX RDF	local polynomial regression, locally adaptive models, forecasting, power systems, nonparametric statistics, short-term load forecasting
14	Dima Grigoriev	Complexity of Positivstellensatz proofs for the knapsack.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	Polynomial calculus, Positivstellensatz proofs, complexity of the knapsack
14	Joos Heintz, Guillermo Matera, Ariel Waissbein	On the Time-Space Complexity of Geometric Elimination Procedures.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Algorithmic elimination theory, Polynomial equation solving, Algebraic complexity theory, Time-space complexity, Computation tree, Symbolic computation, Straight-line program
14	Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf	Quantum lower bounds by polynomials.	J. ACM	2001	DBLP DOI BibTeX RDF	polynomial method, lower bounds, Quantum computing, query complexity, black-box model
14	Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara	Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.	ISAAC	2001	DBLP DOI BibTeX RDF	fragmentary pattern, string resemblance, polynomial-time approximation, NP-completeness, string matching
14	Johann Großschädl	A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m).	CHES	2001	DBLP DOI BibTeX RDF	iterative modulo multiplication, polynomial basis representation, bit-serial multiplier architecture, smart card crypto-coprocessor, Elliptic curve cryptography, finite field arithmetic
14	Howard Cheng, George Labahn	Computing all factorizations in ***.	ISSAC	2001	DBLP DOI BibTeX RDF	structured matrices, polynomial factorization
14	Vadim V. Lozin, Michael U. Gerber	On the Jump Number Problem in Hereditary Classes of Bipartite Graphs.	Order	2000	DBLP DOI BibTeX RDF	jump number, bipartite graphs, polynomial algorithm
14	Alper Halbutogullari, Çetin Kaya Koç	Mastrovito Multiplier for General Irreducible Polynomials.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	complexity, Finite fields, multiplication, irreducible polynomials, polynomial basis
14	Andrzej Hlawiczka, Michal Kopec	Design and testing of fast and cost effective serial seeding TPGs based on one-dimensional linear hybrid cellular automata.	Asian Test Symposium	2000	DBLP DOI BibTeX RDF	serial seeding, linear hybrid cellular automata, n-cell CA register, p CdSR registers, cellular automata quasi shift register, PCASR, n-bit input sequence, logic testing, cellular automata, integrated circuit testing, automatic test pattern generation, application specific integrated circuits, polynomials, polynomial, logic CAD, cost, TPG, flip-flops, flip-flops, shift registers, pattern generators, integrated circuit economics
14	Serafino Cicerone, Daniele Frigioni, Paolino Di Felice	Decomposing Spatial Databases and Applications.	DEXA Workshops	2000	DBLP DOI BibTeX RDF	spatial database decomposition, boundary decomposition, polynomial time algorithm, visual databases, topological invariants
14	Julio César López-Hernández, Ricardo Dahab	High-Speed Software Multiplication in F2m.	INDOCRYPT	2000	DBLP DOI BibTeX RDF	Multiplication in $ bbbf_{2^m}$, Elliptic Curve Cryptography, Polynomial Basis
14	Yoshifusa Ito	Surface-Tracing Approximation by Basis Functions and Its Application to Neural Networks.	IJCNN (4)	2000	DBLP DOI BibTeX RDF	Surface Tracing, Neural Network, Approximation, Radial Basis Function, Polynomial, Basis Function
14	Bill Triggs	Camera Pose and Calibration from 4 or 5 Known 3D Points.	ICCV	1999	DBLP DOI BibTeX RDF	Camera Pose & Calibration, Direct Linear Transform, Polynomial Solving, Multiresultants, Eigensystems
14	Madhu Sudan 0001, Luca Trevisan, Salil P. Vadhan	Pseudorandom Generators without the XOR Lemma (Abstract).	CCC	1999	DBLP DOI BibTeX RDF	polynomial reconstruct ion, Pseudorandom generators, extractors, list-decoding
14	Colin de la Higuera	Learning Stochastic Finite Automata from Experts.	ICGI	1998	DBLP DOI BibTeX RDF	identification with probability one, polynomial learning, stochastic deterministic finite automata, grammatical inference
14	Steffen Reith, Klaus W. Wagner	On Boolean Lowness and Boolean Highness.	COCOON	1998	DBLP DOI BibTeX RDF	lowness, highness, boolean lowness, boolean highness, boolean hierarchy, hard/easy, Computational complexity, advice, polynomial-time hierarchy, collapse
14	Suresh K. Lodha, Richard Franke	Scattered Data Techniques for Surfaces.	Scientific Visualization	1997	DBLP DOI BibTeX RDF	radial, visualization, interpolation, triangulation, polynomial, surfaces, subdivision, algebraic, splines, parametric, scattered, rational, alpha shape, interrogation
14	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan	Weak Random Sources, Hitting Sets, and BPP Simulations.	FOCS	1997	DBLP DOI BibTeX RDF	BPP simulations, parallel classes, lower bound, sampling, polynomial time, randomised algorithms, hitting sets, weak random source, weak random sources, min-entropy
14	Tomas Sander, Mohammad Amin Shokrollahi	Deciding Properties of Polynomials Without Factoring.	FOCS	1997	DBLP DOI BibTeX RDF	factoring polynomials, polynomial time algorithm, number theory, number theory, Monte Carlo algorithms, algebraic number fields, algebraic equations
14	Supratik Chakraborty, David L. Dill	Approximate algorithms for time separation of events.	ICCAD	1997	DBLP DOI BibTeX RDF	Time separation of events, timing constraint graph, min/max constraints, conservative approximation, non-convex feasible space, convex approximation, polynomial-time algorithm
14	Jack H. Lutz, Yong Zhao	The Density of Weakly Complete Problems under Adaptive Reductions.	CCC	1997	DBLP DOI BibTeX RDF	dense languages, polynomial reductions, sparse languages, weak completeness, computational complexity, complexity classes, resource-bounded measure
14	Andrea Silvetti, Claudio Delrieux, Silvia Castro	T-Splines: A New Schema for C2 Spline Interpolation.	SCCC	1997	DBLP DOI BibTeX RDF	C/sup 2/ spline interpolation, interactive CAGD systems, algebraic interpolation, geometric interpolation, architectural design problems, polynomial interpolation methods, nonuniform parametrization schema, interpolation, necessary conditions, T-Splines
14	Willem A. de Graaf, Gábor Ivanyos, Lajos Rónyai	Computing Cartan subalgebras of Lie algebras.	Appl. Algebra Eng. Commun. Comput.	1996	DBLP DOI BibTeX RDF	Cartan subalgebra, Polynomial time algorithm, Symbolic computation, Lie algebra
14	Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki	Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).	ISAAC	1996	DBLP DOI BibTeX RDF	bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree
14	Arun Balakrishnan, Srimat T. Chakradhar	Retiming with logic duplication transformation: theory and an application to partial scan.	VLSI Design	1996	DBLP DOI BibTeX RDF	logic duplication transformation, partial scan application, RLD configurations, RLD transformation, testability metrics, scan flip-flops, sequential circuit design, linear programming, timing, integer programming, logic design, sequential circuits, logic CAD, polynomial time algorithm, integer linear program, flip-flops, retiming, integrated circuit design, circuit CAD, integrated logic circuits, objective function
14	Juan Sabia, Pablo Solernó	Bounds for traces in complete intersections and degrees in the Nullstellensatz.	Appl. Algebra Eng. Commun. Comput.	1995	DBLP DOI BibTeX RDF	Complete intersection polynomial ideals, Bezout’s inequality, Effective Nullstellensatz, Bertini’s theorem, Trace theory
14	Vijay K. Jain, L. Lin	High-speed double precision computation of nonlinear functions.	IEEE Symposium on Computer Arithmetic	1995	DBLP DOI BibTeX RDF	high-speed double precision computation, interpolative approach, third degree polynomial, image processing, interpolation, interpolation, scientific computing, digital arithmetic, multiplications, coprocessors, coprocessors, real-time image processing, nonlinear functions, silicon area
14	Wenzhe Luo, Graham A. Jullien, Neil M. Wigley, William C. Miller, Zhongde Wang	An array processor for inner product computations using a Fermat number ALU.	ASAP	1995	DBLP DOI BibTeX RDF	inner product computations, Fermat number ALU, parallel independent computations, polynomial mapping, computational ring, parallel architectures, residue number systems
14	Toshihide Ibaraki, Tiko Kameda, Naoki Katoh	Cautious Transaction Schedulers for Database Concurrency Control.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	cautious schedulers, WW, write-write constraints, WRW, WW-scheduler, polynomial-time scheduling algorithm, read sets, write sets, scheduling, computational complexity, computational complexity, distributed databases, distributed databases, NP-complete, database theory, transaction schedulers, database concurrency control
14	Sriram Sankaranarayanan 0001	Automatic invariant generation for hybrid systems using ideal fixed points.	HSCC	2010	DBLP DOI BibTeX RDF	verification, hybrid systems, invariants, conservation laws, algebraic geometry
14	Vikraman Arvind, Srikanth Srinivasan 0001	On the hardness of the noncommutative determinant.	STOC	2010	DBLP DOI BibTeX RDF	noncommutative rings, determinant, arithmetic circuits, permanent
14	Elad Haramaty, Amir Shpilka	On the structure of cubic and quartic polynomials.	STOC	2010	DBLP DOI BibTeX RDF	Gowers norm, cubic polynomials, quartic polynomials
14	Adam Tauman Kalai, Ankur Moitra, Gregory Valiant	Efficiently learning mixtures of two Gaussians.	STOC	2010	DBLP DOI BibTeX RDF	Gaussians, finite mixture models, method of moments
14	Ran Raz, Amir Yehudayoff	Lower Bounds and Separations for Constant Depth Multilinear Circuits.	Comput. Complex.	2009	DBLP DOI BibTeX RDF	68Q17, Subject classification
14	Daniel Panario, David Thomson	Efficient p th root computations in finite fields of characteristic p.	Des. Codes Cryptogr.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 12E30
14	Xi Chen 0001, Xiaotie Deng, Shang-Hua Teng	Settling the complexity of computing two-player Nash equilibria.	J. ACM	2009	DBLP DOI BibTeX RDF	Arrow-Debreu market, Brouwer's fixed point, Lemke-Howson algorithm, PPAD-completeness, Sperner's lemma, Nash equilibrium, smoothed analysis, Two-player game
14	Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo	Kernel Bounds for Disjoint Cycles and Disjoint Paths.	ESA	2009	DBLP DOI BibTeX RDF
14	Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hirotaka Ono 0001	Graph orientation to maximize the minimum weighted outdegree.	IPDPS	2009	DBLP DOI BibTeX RDF
14	Marcin Jaromin	Approximation of Signals by Predict Wavelet Transform.	ICCVG	2008	DBLP DOI BibTeX RDF
14	Benny Godlin, Tomer Kotek, Johann A. Makowsky	Evaluations of Graph Polynomials.	WG	2008	DBLP DOI BibTeX RDF
14	Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik	Fast convergence to nearly optimal solutions in potential games.	EC	2008	DBLP DOI BibTeX RDF	potential games, game theory, nash equilibrium, price of anarchy, congestion games, convergence time
14	Ran Raz, Amir Yehudayoff	Lower Bounds and Separations for Constant Depth Multilinear Circuits.	CCC	2008	DBLP DOI BibTeX RDF	Constant Depth, Lower Bounds, Separations, Arithmetic Circuits
14	Ravi Kannan, Thorsten Theobald	Games of fixed rank: a hierarchy of bimatrix games.	SODA	2007	DBLP BibTeX RDF
14	Xin Li 0009, Marc Moreno Maza, Éric Schost	On the Virtues of Generic Programming for Symbolic Computation.	International Conference on Computational Science (2)	2007	DBLP DOI BibTeX RDF	fast arithmetic, polynomials, high performance, Generic programming, efficient implementation
14	Erich L. Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi	Lower bounds for approximate factorizations via semidefinite programming: (extended abstract).	SNC	2007	DBLP DOI BibTeX RDF	hybrid method, SDP, approximate factorization
14	Noam Kogan, Tamir Tassa	Improved efficiency for revocation schemes via Newton interpolation.	ACM Trans. Inf. Syst. Secur.	2006	DBLP DOI BibTeX RDF	Newton interpolation, secret sharing, broadcast encryption, User revocation
14	Carlos Morra, M. Sackmann, Sunil Shukla, Jürgen Becker 0001, Reiner W. Hartenstein	From Equation to VHDL: Using Rewriting Logic for Automated Function Generation.	FPL	2006	DBLP DOI BibTeX RDF
14	Lance Fortnow, Mitsunori Ogihara	Very Sparse Leaf Languages.	MFCS	2006	DBLP DOI BibTeX RDF
14	Ho-Sung Park, Tae-Chon Ahn	The Analysis and Design of IG_gHSOFPNN by Evolutionary Optimization.	FSKD	2006	DBLP DOI BibTeX RDF
14	Ho-Sung Park, Sung-Kwun Oh, Tae-Chon Ahn	Improvement of HSOFPNN Using Evolutionary Algorithm.	Australian Conference on Artificial Intelligence	2006	DBLP DOI BibTeX RDF
14	Erich L. Kaltofen, Lihong Zhi	Hybrid symbolic-numeric computation.	ISSAC	2006	DBLP DOI BibTeX RDF	symbolic/numeric hybrid methods
14	Bruno Salvy	D-finiteness: algorithms and applications.	ISSAC	2005	DBLP DOI BibTeX RDF	creative telescoping, computer algebra, linear recurrences, elimination, linear differential equations
14	Peter Bürgisser	The Complexity of Factors of Multivariate Polynomials.	Found. Comput. Math.	2004	DBLP DOI BibTeX RDF
14	Ho-Sung Park, Sung-Kwun Oh, Witold Pedrycz, Hyun-Ki Kim	Genetically Optimized Self-Organizing Neural Networks Based on PNs and FPNs.	ISNN (1)	2004	DBLP DOI BibTeX RDF
14	John M. Hitchcock, N. V. Vinodchandran	Dimension, Entropy Rates, and Compression.	CCC	2004	DBLP DOI BibTeX RDF
14	Christopher Lynch	Schematic Saturation for Decision and Unification Problems.	CADE	2003	DBLP DOI BibTeX RDF
14	Sudipta Sengupta	Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection.	WADS	2003	DBLP DOI BibTeX RDF
14	Nader H. Bshouty, Dmitry Gavinsky	PAC = PAExact and Other Equivalent Models in Learning.	FOCS	2002	DBLP DOI BibTeX RDF
14	Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik	Complexity of Semi-algebraic Proofs.	STACS	2002	DBLP DOI BibTeX RDF
14	Jun Sawada, Ruben Gamboa	Mechanical Verification of a Square Root Algorithm Using Taylor's Theorem.	FMCAD	2002	DBLP DOI BibTeX RDF
14	Johann A. Makowsky	Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width.	SODA	2001	DBLP BibTeX RDF
14	Adam R. Klivans, Daniel A. Spielman	Randomness efficient identity testing of multivariate polynomials.	STOC	2001	DBLP DOI BibTeX RDF
14	Amr M. Youssef, Guang Gong	On the Interpolation Attacks on Block Ciphers.	FSE	2000	DBLP DOI BibTeX RDF	interpolation attack, Galois Field Fourier Transform, cryptanalysis, Block cipher, finite fields
14	O. D. Zhukov, Naphtali Rishe	Effective Computer Technology for Data Processing.	ICPADS	1997	DBLP DOI BibTeX RDF
14	Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers	Inverting Onto Functions.	CCC	1996	DBLP DOI BibTeX RDF	function classes, total functions, nondeterministic Turing machines, unambiguous computation, Computational complexity, invertibility
14	Johannes Köbler, Osamu Watanabe 0001	New Collapse Consequences of NP Having Small Circuits.	ICALP	1995	DBLP DOI BibTeX RDF
14	Jovan Dj. Golic	Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers.	EUROCRYPT	1995	DBLP DOI BibTeX RDF
14	Michel Cosnard, Martín Matamala	On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC.	MFCS	1994	DBLP DOI BibTeX RDF
14	Dorit S. Hochbaum, J. George Shanthikumar	Convex Separable Optimization Is Not Much Harder than Linear Optimization	J. ACM	1990	DBLP DOI BibTeX RDF
14	Oded Goldreich 0001, Hugo Krawczyk	Sparse Pseudorandom Distributions.	CRYPTO	1989	DBLP DOI BibTeX RDF
14	Alvy Ray Smith	Planar 2-pass texture mapping and warping.	SIGGRAPH	1987	DBLP DOI BibTeX RDF
14	Morton Goldberg	On the computation of least squares polynomials.	Commun. ACM	1967	DBLP DOI BibTeX RDF
14	G. B. Fitzpatrick	Synthesis of Binary Ring Counters of Given Periods.	J. ACM	1960	DBLP DOI BibTeX RDF
13	Mohammed Yasin H, M. Suresh, Zebene G. Tefera, Samuel Asefa Fufa	M-Polynomial and NM-Polynomial Methods for Topological Indices of Polymers.	Int. J. Math. Math. Sci.	2024	DBLP DOI BibTeX RDF
13	Manoj Kummini, Dharm Veer	The $h$-Polynomial and the Rook Polynomial of some Polyominoes.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
13	Jingyu Ding, Yu Liu 0009, Jinyong Yu, Xuebo Yang	Interval type-2 polynomial fuzzy fault detection scheme with a multi-order homogeneous polynomial Lyapunov functions considering unmeasurable premise variables.	Inf. Sci.	2023	DBLP DOI BibTeX RDF
13	Hwan Pyo Moon, Soo Hyun Kim, Song-Hwa Kwon	Gauss-Legendre polynomial basis for the shape control of polynomial curves.	Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
13	Alex Scott 0001, Paul D. Seymour, Sophie Spirkl	Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path.	Comb.	2023	DBLP DOI BibTeX RDF
13	Joshua A. Grochow	Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality.	Theory Comput. Syst.	2023	DBLP DOI BibTeX RDF
13	Alberto Del Pia, Aida Khajavirad	The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization.	CoRR	2023	DBLP DOI BibTeX RDF
13	Colby Fronk, Jaewoong Yun, Prashant Singh, Linda R. Petzold	Bayesian polynomial neural networks and polynomial neural ordinary differential equations.	CoRR	2023	DBLP DOI BibTeX RDF
13	Mitchell Tong Harris, Pierre-David Letourneau, Dalton Jones, Matthew Harper Langston	An Efficient Framework for Global Non-Convex Polynomial Optimization with Nonlinear Polynomial Constraints.	CoRR	2023	DBLP DOI BibTeX RDF
13	Joshua A. Grochow	Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality.	CoRR	2023	DBLP DOI BibTeX RDF
13	Hamdi Gassara, Mohamed Boukattaya, Ahmed El Hajjaji	Polynomial Adaptive Observer-Based Fault Tolerant Control for Time Delay Polynomial Fuzzy Systems Subject to Actuator Faults.	Int. J. Fuzzy Syst.	2023	DBLP DOI BibTeX RDF
13	Hamdi Gassara, Mourad Elloumi, Omar Naifar, Abdellatif Ben Makhlouf	Robust fault estimation for polynomial systems with time delay via a polynomial adaptive observer.	Trans. Inst. Meas. Control	2023	DBLP DOI BibTeX RDF
13	Eduard M. Macías, Rosana Pérez, Héctor Jairo Martínez	An explicit polynomial to globalize algorithms for solving matrix polynomial equations.	J. Comput. Appl. Math.	2023	DBLP DOI BibTeX RDF
13	Benedikt Pago	Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus.	CSL	2023	DBLP DOI BibTeX RDF
13	Abderrahim Messaoudi, Hamdi Gassara, Salama Makni, Ahmed El Hajjaji	Design of Polynomial Observer-Based Fault-Tolerant Controller for Polynomial Systems with State Delay: A Sum of Squares Approach.	Circuits Syst. Signal Process.	2022	DBLP DOI BibTeX RDF
13	Kiana Karami, David T. Westwick, Johan Schoukens	Applying Polynomial Decoupling Methods to the Polynomial NARX Model.	CoRR	2022	DBLP BibTeX RDF
13	Benedikt Pago	Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus.	CoRR	2022	DBLP DOI BibTeX RDF
13	P. F. Pryashnikova	Robust D-Decomposition for a Polynomial Dependence of the Coefficients of a Polynomial on Two Parameters.	Autom. Remote. Control.	2022	DBLP DOI BibTeX RDF
13	Tomoyuki Yamakami	Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice.	Inf. Comput.	2022	DBLP DOI BibTeX RDF
13	Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa	Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings.	WG	2022	DBLP DOI BibTeX RDF
13	Dong Lu, Dingkang Wang, Fanghui Xiao, Xiaopeng Zheng	A Property of Modules Over a Polynomial Ring With an Application in Multivariate Polynomial Matrix Factorizations.	ISSAC	2022	DBLP DOI BibTeX RDF
13	Modjtaba Ghorbani, Maryam Jalali-Rad, Matthias Dehmer	Orbit Polynomial of Graphs versus Polynomial with Integer Coefficients.	Symmetry	2021	DBLP DOI BibTeX RDF