Suchergebnisse - Algorithms in number theory

Sums of Reciprocals of Fractional Parts and Multiplicative Diophantine Approximation von Beresnevich, Victor, Haynes, Alan, Velani, Sanju

“… There are two main interrelated goals of this paper. Firstly we investigate the sums …”
Volltext

Randomization, relaxation, and complexity in polynomial equation solving : Banff International Research Station workshop on Randomization, Relaxation, and Complexity, February 28-March 5, 2010, Banff, Ontario, Canada von Randomization, relaxation, and complexity, Gurvits, Leonid, Pébay, Philippe, Rojas, J. Maurice, Thompson, David

“… for clusters of roots, and speed-ups for counting real solutions. Vital related topics such as circuit complexity, random polynomials over local fields, tropical geometry, and the theory of fewnomials, amoebae, and coamoebae are treated as well …”
Volltext

Algorithms in number theory von Sorenson, Jonathan Paul

“… This thesis discusses four sets of results on number theoretic algorithms. A positive integer $n …”
Volltext

On Euclid’s algorithm and elementary number theory von Backhouse, Roland, Ferreira, João F.

“… ) and as a construction interface (i.e., how to investigate and derive new theorems). The theorems that we verify are well-known and most of them are included in standard number-theory books …”
Volltext

Women in Numbers 2 : research directions in number theory : BIRS Workshop, WIN2 -- Women in Numbers 2, November 6-11, 2011, Banff International Research Station, Banff, Alberta, Canada von WIN (Conference), David, Chantal, Lalin, Matilde, Manes, Michelle

“… ) in Banff, Alberta, Canada. During the workshop, group leaders presented open problems in various areas of number theory, and working groups tackled those problems in collaborations begun at the workshop and continuing long after …”
Volltext

Overlapping Iterated Function Systems from the Perspective of Metric Number Theory von Baker, Simon

“… In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from …”
Volltext

Algorithmic arithmetic, geometry, and coding theory : 14th International Conference Arithmetic, Geometry, Cryptography, and Coding Theory, June 3-7 2013, CIRM Marseille, France von International Conference "Arithmetic, Geometry, Cryptography and Coding Theory", Ballet, Stéphane, Perret, M. (Marc), Zaĭt︠s︡ev, Alekseĭ

“… This volume contains the proceedings of the 14th International Conference on Arithmetic, Geometry, Cryptography, and Coding Theory (AGCT …”
Volltext

Study on the application of elementary number theory in conflict algorithm von Zhao, Zhi, Huang, Jinde

“… Analyze the time complexity of the algorithm, for multiple threads to execute multiple transactions at the same time, and map the result of the remainder of the prime number to the hash address …”
Volltext

Exploring Number Theory: From Prime Numbers to Cryptographic Algorithms von K.L, Bajaj

“… This paper delves into the intricate world of number theory, tracing its historical development and highlighting its pivotal role in modern cryptographic algorithms …”
Volltext

THE GENERAL QUASI-ORDER ALGORITHM IN NUMBER THEORY von Hilton, Peter, Pedersen, Jean

“… This paper deals with a generalization of the Binary Quasi-Order Theorem. This generalization involves a more complicated algorithm than (0.2 …”
Volltext

A novel distance of intuitionistic trapezoidal fuzzy numbers and its-based prospect theory algorithm in multi-attribute decision making model von Ren, Haiping, Luo, Laijun

“… We first put forward a new distance measure of intuitionistic trapezoidal fuzzy numbers. Then combining with cumulative prospect theory, we develop a novel decision making method, which can consider risk attitude of decision makers …”
Volltext

Quantum computation in algebraic number theory: Hallgren’s efficient quantum algorithm for solving Pell’s equation von Jozsa, Richard

“… The best known classical algorithm has sub-exponential running time O( exp log d , poly(n)) . Hallgren’s quantum algorithm gives the result in polynomial time O …”
Volltext

A constructive proof of scherk's theorem on the representation of primes von Shapiro, Jacob, Waxman, Jerry

“… This paper presents a constructive proof of Scherk's theorem based on an explicit algorithm for choosing the signs in time 0(n) …”
Volltext

A graph-theory-based Euler number computing algorithm von Bin Yao, Shiying Kang, Xiao Zhao, Yuyan Chao, Lifeng He

“… This paper proposes a new graph-theory-based Euler number computing algorithm. The proposed algorithm only needs to count two bit-quad patterns in the given image, while conventional bit-quad-based algorithms need to count ten …”
Volltext

Computational challenges and solutions: Prime number generation for enhanced data security von Ezz-Eldien, Amal, Ezz, Mohamed, Alsirhani, Amjad, Mostafa, Ayman Mohamed, Alomari, Abdullah, Alserhani, Faeiz, Alshahrani, Mohammed Mujib

“… This paper addresses the computational methods and challenges associated with prime number generation, a critical component in encryption algorithms for ensuring data security …”
Volltext

Summing μ(n): a faster elementary algorithm von Helfgott, Harald Andrés, Thompson, Lola

“… We present a new elementary algorithm that takes time O ϵ x 3 5 ( log x ) 8 5 + ϵ …”
Volltext

A reduction algorithm for Hilbert modular groups von Strömberg, Fredrik

“… The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields …”
Volltext

On theory and fast algorithms for error correction in residue number system product codes von Krishna, H., Sun, J.-D.

“… The authors develop a coding theory approach to error control in residue number system product codes …”
Volltext

Minimizing the number of paths in BDDs: Theory and algorithm von Fey, G., Drechsler, R.

“… The complexity of circuit and systems design increases rapidly. Therefore, a main focus of research in the area of electronic-design automation are efficient algorithms and data structures …”
Volltext

Genotype copy number variations using Gaussian mixture models: theory and algorithms von Lin, Chang-Yun, Lo, Yungtai, Ye, Kenny Q

“… Copy number variations (CNVs) are important in the disease association studies and are usually targeted by most recent microarray platforms developed for GWAS studies …”
Weitere Angaben