20 results for “Number theory”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper presents two algorithms using the Newton-Raphson method to calculate the floor of y**(1/m) for natural integer numbers y > 2 and m > 1, which can be used to determine if y is an integer pow…
This paper introduces the concept of 'large' zeros in linear recurrence sequences and establishes that they either do not exist or are very sparse, which could lead to decidability of the Skolem Probl…
This paper provides bounds on the difference between the annihilation number and independence number of a finite simple graph, and proves these bounds for various types of graphs.
This paper provides an introduction to modern developments in combinatorial discrepancy theory, focusing on algorithmic and convex geometric ideas.
This paper surveys structured lattices and their applications in lattice-based cryptography and secure wireless communications.
This paper traces the historical development of the square-and-multiply algorithm, arguing that while its conceptual foundation dates back to ancient Indian prosody, its formal articulation as a gener…
This paper introduces new algorithms for finding prime numbers up to a given bound, achieving a speedup of log N over the sieve of Eratosthenes.
Enrica Duchi, Adrián Lillo, Pablo Puerto, Mercedes Rosas +1 more
The paper establishes bijections between tree records, girth of connected endofunctions, and genesis sequences, deriving generating functions for tree and forest record numbers using Cayley's tree fun…
The paper studies properties of parity based bit-counting complexity classes B|0|⊕P and B|1|⊕P, proves inclusions and closures, and shows they contain PH and are contained in CH.
This paper provides the first unconditional proof for Weber's Conjecture for the case $k ext{ up to } 12$, which is crucial for lattice-based cryptography.
The paper places the existential theory of the reals in the counting hierarchy and provides bounds for various problems.
The paper proves a lower and upper bound for the maximum number of copies of a graph F in an H-free graph on n vertices.
The authors determine the hundredths digit of the real Grothendieck constant with a new estimate.
The authors provide a deterministic algorithm for solving integer programs in standard form with improved running time.
This paper shows #P-completeness for several graph counting problems using a new technique.