Representing the integer factorization problem using ordered binary decision diagrams

DOI10.1007/s00224-023-10147-7OpenAlexW4387766306MaRDI QIDQ6185610

No author found.

Publication date: 8 January 2024

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-023-10147-7

zbMATH Keywords

Boolean satisfiabilitybinary decision diagraminteger factorization

Mathematics Subject Classification ID

Boolean functions (06E30) Factorization (11Y05) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean Gröbner bases
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• Bounds on the OBDD-size of integer multiplication via universal hashing
• Factorization using binary decision diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• An exponent one-fifth algorithm for deterministic integer factorisation
• A time-space tradeoff for Lehman’s deterministic integer factorization method