On the Efficiency of Algorithms for Polynomial Factoring

Mathematics of Computation - United States
doi 10.2307/2005794
Full Text
Abstract

Available in full text

Date
Authors
Publisher

JSTOR

Related search

Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Refined Analysis and Improvements on Some Factoring Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1981English

Factoring Solution Sets of Polynomial Systems in Parallel

English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

Polynomial Algorithms for Linear Programming

Lecture Notes in Economics and Mathematical Systems
MathematicsEconomicsEconometricsFinance
1988English

New Pragmatic Algorithms to Improve Factoring of Large Numbers

International Journal of Theoretical and Applied Mathematics
2017English

Polynomial Time Algorithms for Scheduling of Arrival Aircraft

2005English

The Granularity of Parallel Homotopy Algorithms for Polynomial Systems of Equations

International Journal of Computer Mathematics
Computational TheoryApplied MathematicsComputer Science ApplicationsMathematics
1989English

Practical Divide-And-Conquer Algorithms for Polynomial Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy