Characteristic sets verses generalized characteristic sets
From MaRDI portal
Publication:5035097
DOI10.1080/09720529.2021.1882160zbMath1484.12007OpenAlexW3156784132MaRDI QIDQ5035097
Murat Cancan, Süleyman Ediz, Safia Akram, Deeba Afzal, Farkhanda Afzal, Muhammad Ashiq
Publication date: 21 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2021.1882160
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characteristic set algorithms for equation solving in finite fields
- Characteristic set method for differential-difference polynomial systems
- Elimination methods
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new algorithmic scheme for computing characteristic sets
- Ontology optimization tactics via distance calculating
- Ontology computation for graph spaces focus on partial vertex pairs
- The eccentric based Zagreb indices of carbon graphite
- Algorithm for computing differential char sets efficiently
- On Wiener index and Wiener polarity index of some polyomino chains
- A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs
- Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer
This page was built for publication: Characteristic sets verses generalized characteristic sets