scispace - formally typeset
Search or ask a question
Topic

Prime (order theory)

About: Prime (order theory) is a research topic. Over the lifetime, 15324 publications have been published within this topic receiving 157801 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: It is proved optimal, up to an arbitrary ε > 0, inapproximability results for Max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting.
Abstract: We prove optimal, up to an arbitrary e > 0, inapproximability results for Max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds for the efficient approximability of many optimization problems studied previously. In particular, for Max-E2-Sat, Max-Cut, Max-di-Cut, and Vertex cover.

1,938 citations

Book ChapterDOI
Victor Shoup1
11 May 1997
TL;DR: Lower bounds on the complexity of the discrete logarithm and related problems are proved that match the known upper bounds: any generic algorithm must perform Ω(p1/2) group operations, where p is the largest prime dividing the order of the group.
Abstract: This paper considers the computational complexity of the discrete logarithm and related problems in the context of "generic algorithms"--that is, algorithms which do not exploit any special properties of the encodings of group elements, other than the property that each group element is encoded as a unique binary string. Lower bounds on the complexity of these problems are proved that match the known upper bounds: any generic algorithm must perform Ω(p1/2) group operations, where p is the largest prime dividing the order of the group. Also, a new method for correcting a faulty Diffie-Hellman oracle is presented.

1,341 citations

Book
01 Jan 1991
TL;DR: In this article, a text on rings, fields and algebras is intended for graduate students in mathematics, aiming the level of writing at the novice rather than at the expert, and by stressing the role of examples and motivation.
Abstract: This text, drawn from the author's lectures at the University of California at Berkeley, is intended as a textbook for a one-term course in basic ring theory. The material covered includes the Wedderburn-Artin theory of semi-simple rings, Jacobson's theory of the radical representation theory of groups and algebras, prime and semi-prime rings, primitive and semi-primitive rings, division rings, ordered rings, local and semi-local rings, and perfect and semi-perfect rings. By aiming the level of writing at the novice rather than at the expert, and by stressing the role of examples and motivation, the author has produced a text which is suitable not only for use in a graduate course, but also for self-study by other interested graduate students. Numerous exercises are also included. This graduate textbook on rings, fields and algebras is intended for graduate students in mathematics.

1,090 citations

Journal ArticleDOI
TL;DR: Two closely-related pseudo-random sequence generators are presented: the ${1 / P} generator, with input P a prime, and the $x^2 \bmod N$generator, which outputs the quotient digits obtained on dividing 1 by P.
Abstract: Two closely-related pseudo-random sequence generators are presented: The ${1 / P}$generator, with input P a prime, outputs the quotient digits obtained on dividing 1 by P. The $x^2 \bmod N$generato...

1,029 citations

Journal ArticleDOI
TL;DR: In this paper, an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite is presented. But the algorithm is not deterministic in the sense that
Abstract: We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.

1,022 citations


Network Information
Related Topics (5)
Generalization
23.5K papers, 483.5K citations
88% related
Conjecture
24.3K papers, 366K citations
88% related
Polynomial
52.6K papers, 853.1K citations
86% related
Algebraic number
20.6K papers, 315.6K citations
86% related
Commutative property
11.8K papers, 164.4K citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20241
20231,119
20222,296
2021893
2020895
2019787