Confluent complement: an algorithm for the intersection of face ideals

DOI10.1007/s13160-022-00504-3OpenAlexW4214943598MaRDI QIDQ2135553

Rostam Sabeti

Publication date: 9 May 2022

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-022-00504-3

zbMATH Keywords

complexitycomputational algebraconfluent complementmulti-branch recursive algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

ConFuL

Uses Software

• SINGULAR

Cites Work

• Minimal resolutions of some monomial ideals
• Polynomial expressions for non-binomial structures
• Computational Complexity of Probabilistic Turing Machines
• Probabilistic Turing Machines and Computability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Confluent complement: an algorithm for the intersection of face ideals