Infinitely many quasi-coincidence point solutions of multivariate polynomial problems
From MaRDI portal
Publication:2015347
DOI10.1155/2013/307913zbMATH Open1381.39020OpenAlexW2093999990WikidataQ58915893 ScholiaQ58915893MaRDI QIDQ2015347FDOQ2015347
Publication date: 23 June 2014
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/307913
Recommendations
Cites Work
- Title not available (Why is that?)
- On coincidence point and fixed point theorems for nonlinear multivalued maps
- New quasi-coincidence point polynomial problems
- Title not available (Why is that?)
- A non-NP-complete algorithm for a quasi-fixed polynomial problem
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Title not available (Why is that?)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- On approximate coincidence point properties and their applications to fixed point theory
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- On multiplicities in polynomial system solving
- New nonlinear conditions and inequalities for the existence of coincidence points and fixed points
- Coincidence theorems on nonconvex sets and its applications
- Coincidence theorems, generalized variational inequality theorems, and minimax inequality theorems for the \(\Phi \)-mapping on \(G\)-convex spaces
- Algorithms for modular counting of roots of multivariate polynomials
Cited In (3)
This page was built for publication: Infinitely many quasi-coincidence point solutions of multivariate polynomial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015347)