Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,336,105 papers from all fields of science
Search
Sign In
Create Free Account
Integer factorization
Known as:
Factoring integers
, Prime factorization algorithm
, Prime decomposition
Expand
In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers. If these integers are further…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AKS primality test
Adleman–Pomerance–Rumely primality test
BQP
Block Lanczos algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Comprehend DeepWalk as Matrix Factorization
Cheng Yang
,
Zhiyuan Liu
arXiv.org
2015
Corpus ID: 17519375
Word2vec, as an efficient tool for learning vector representation of words has shown its effectiveness in many natural language…
Expand
Review
2014
Review
2014
The computational air traffic control brain : computational red teaming and big data for real-time seamless brain-traffic integration
H. Abbass
2014
Corpus ID: 53021753
As SESAR, NextGen and the world move towards more automation of Air Traffic Control (ATC) tasks to safely accommodate future…
Expand
2011
2011
Integer factorization algorithms
Polona Bogataj
2011
Corpus ID: 120941915
The decomposition of a natural number into a product of prime numbers is called factorization. The main problem with…
Expand
2010
2010
LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings
A. López-Ortiz
Lecture Notes in Computer Science
2010
Corpus ID: 31153020
Continuous and Discrete Methods in Computer Science.- Colorful Strips.- The Mono- and Bichromatic Empty Rectangle and Square…
Expand
2008
2008
N T ] 1 3 Se p 20 07 A deterministic version of Pollard ’ s p − 1 algorithm
Bartosz´zra Lek
2008
Corpus ID: 12535959
We present a deterministic version of Pollard's p − 1 integer fac-toring algorithm. More precisely, we prove that the integers…
Expand
2001
2001
Retargetable Compiler Technology for Embedded Systems
R. Leupers
,
P. Marwedel
Springer US
2001
Corpus ID: 8588435
State Machine, 116 Action function, 82, 85, 103, 129, 143 Address code optimization, 53 Address generation unit, 53, 89, 94, 97…
Expand
2000
2000
Solving the Sports League Scheduling Problem with Tabu Search
Jean-Philippe Hamiez
,
Jin-Kao Hao
Local Search for Planning and Scheduling
2000
Corpus ID: 2916171
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on…
Expand
1999
1999
Network fragments
Suzanne M. Mahoney
,
Kathryn B. Laskey
1999
Corpus ID: 86538218
Bayesian networks are widely used for reasoning about uncertainty. Small fixed models over a predefined set of variables work for…
Expand
1988
1988
Combining Z-buffer Engines for Higher-Speed Rendering
S. Molnar
Advances in Computer Graphics Hardware
1988
Corpus ID: 2568775
Described is a hardware architecture for combining the outputs of a number of z-buffer rendering engines to achieve higher…
Expand
1978
1978
Theory of analytic modulation systems
B. Logan
Bell Labs technical journal
1978
Corpus ID: 31460150
A general theory of analytic modulation systems is developed where the transmitted signal is of the form σ(t) = Re {eiwctf(z(t…
Expand