AI & ChatGPT searches , social queries for CLASS NUMBER-PROBLEM
Search references for CLASS NUMBER-PROBLEM. Phrases containing CLASS NUMBER-PROBLEM
See searches and references containing CLASS NUMBER-PROBLEM!
Search references for CLASS NUMBER-PROBLEM. Phrases containing CLASS NUMBER-PROBLEM
See searches and references containing CLASS NUMBER-PROBLEM!CLASS NUMBER-PROBLEM
Listing all imaginary quadratic fields with a given class number
In mathematics, the Gauss class number problem (for imaginary quadratic fields), as usually understood, is to provide for each n ≥ 1 {\displaystyle n\geq
Class_number_problem
In number theory, measure of non-unique factorization
In mathematics, the ideal class group (or class group) of an algebraic number field K {\displaystyle K} is the quotient group J K / P K {\displaystyle
Ideal_class_group
number fields with class number 1. It is believed that there are infinitely many such number fields, but this has not been proven. The class number of
List of number fields with class number one
List_of_number_fields_with_class_number_one
Concept in algebraic number theory
such numbers is a special case of the class number problem, and they underlie several striking results in number theory. According to the Stark–Heegner
Heegner_number
Complexity class used to classify decision problems
polynomial time) is a complexity class used to classify decision problems. NP is the set of decision problems for which the problem instances, where the answer
NP_(complexity)
Quadratic imaginary number fields with unique factorisation
special case of Gauss's class number problem of determining the number of imaginary quadratic fields that have a given fixed class number. Let Q denote the
Stark–Heegner_theorem
Complexity class
complexity class #P (pronounced "sharp P" or, sometimes "number P" or "hash P") is the set of the counting problems associated with the decision problems in the
♯P
Unsolved problem in computer science
Unsolved problem in computer science If the solution to a problem can be checked in polynomial time, must the problem be solvable in polynomial time? More
P_versus_NP_problem
Field (mathematics) generated by the square root of an integer
theory of binary quadratic forms. There remain some unsolved problems. The class number problem is particularly important. For a nonzero square free integer
Quadratic_field
Issue when estimating a probability
In statistics, the reference class problem is the problem of deciding what class to use when calculating the probability applicable to a particular case
Reference_class_problem
On algebraic independence of logarithms
Diophantine equations, and to solve the class number problem of finding all imaginary quadratic fields with class number 1. To simplify notation, let L {\displaystyle
Baker's_theorem
Set of problems in computational complexity theory
In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly
Complexity_class
Area of a right triangle with rational-numbered sides
whether a given rational number is a congruent number is called the congruent number problem. As of 2019[update], this problem has not been brought to
Congruent_number
Study of numbers that are not solutions of polynomials with rational coefficients
of Baker's theorem contained such bounds, solving Gauss' class number problem for class number one in the process. This work won Baker the Fields Medal
Transcendental_number_theory
Complexity class
The #P-complete problems (pronounced "sharp P complete", "number P complete", or "hash P complete") form a complexity class in computational complexity
♯P-complete
rate of rk(N) (see Szemerédi's theorem) Class number problem: are there infinitely many real quadratic number fields with unique factorization? Fontaine–Mazur
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
On the reciprocity law in algebraic number fields
algebraic number field, where k is a power of a prime. The problem was partially solved for abelian extensions by Artin reciprocity and class field theory
Hilbert's_ninth_problem
1798 textbook by Carl Friedrich Gauss
Modern Number Theory, New York, New York: Springer-Verlag, pp. 358–361, ISBN 978-0-387-97329-6 Goldfeld, Dorian (July 1985), "Gauss' Class Number Problem For
Disquisitiones_Arithmeticae
23 mathematical problems stated in 1900
that certain problems of contemporary nature seem to apply; for example, most modern number theorists would probably see the 9th problem as referring
Hilbert's_problems
Open problem on 3x+1 and x/2 functions
Unsolved problem in mathematics For even numbers, divide by 2; For odd numbers, multiply by 3 and add 1. With enough repetition, do all positive integers
Collatz_conjecture
Finite extension of the rationals
{\displaystyle K} has class number 1. Given a number field, the class number is often difficult to compute. The class number problem, going back to Gauss
Algebraic_number_field
English mathematician (1939–2018)
made significant contributions to several areas in number theory, such as the Gauss class number problem, diophantine approximation, and to Diophantine equations
Alan_Baker_(mathematician)
Seven mathematical problems with a US$1 million prize for each solution
selected problems span a number of mathematical fields, namely algebraic geometry, arithmetic geometry, geometric topology, mathematical physics, number theory
Millennium_Prize_Problems
Type of computational problem
between complexity classes of P, NP, PH, etc, in circuit complexity, and in interactive proof systems. Let R be a search problem, formalised as a binary
Counting_problem_(complexity)
Formula in number theory
In number theory, the class number formula relates many important invariants of an algebraic number field to a special value of its Dedekind zeta function
Class_number_formula
American mathematician (1950–2025)
the L-function of elliptic curves and led to breakthroughs on the class number problem of Carl Friedrich Gauss. Gross first met his wife Jill P. Mesirov
Benedict_Gross
Yes/no problem in computer science
natural number is prime. Another example is the problem, "given two numbers x and y, does x evenly divide y?" A decision procedure for a decision problem is
Decision_problem
Gaussian period Fermat's Last Theorem Class number problem for imaginary quadratic fields Stark–Heegner theorem Heegner number Langlands program Different ideal
List of algebraic number theory topics
List_of_algebraic_number_theory_topics
Inherent difficulty of computational problems
of a problem being hard for a complexity class. A problem X {\displaystyle X} is hard for a class of problems C {\displaystyle C} if every problem in C
Computational complexity theory
Computational_complexity_theory
Probability of shared birthdays
In probability theory, the birthday problem asks for the probability that, in a set of n randomly chosen people, at least two will share the same birthday
Birthday_problem
Complexity class
algorithm to solve a single NP-hard problem would give polynomial time algorithms for all the problems in the complexity class NP. As it is suspected, but unproven
NP-hardness
number of accepting computation paths is odd. An example of a ⊕P problem is "does a given graph have an odd number of perfect matchings?" The class was
Parity_P
Brocard's problem Chinese remainder theorem Chinese remainder theorem class field The class field theory concerns abelian extensions of number fields. class number
Glossary_of_number_theory
Problem of determining if a Boolean formula could be made true
is the first problem that was proven to be NP-complete—this is the Cook–Levin theorem. This means that all problems in the complexity class NP, which includes
Boolean satisfiability problem
Boolean_satisfiability_problem
Prize awarded by the American Mathematical Society
JSTOR 1970476. Zbl 0223.02050. Goldfeld, Dorian (1985). "Gauss' class number problem for imaginary quadratic fields" (PDF). Bulletin of the American Mathematical
Cole_Prize
Class in computational complexity theory
the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of
NC_(complexity)
Université de Montréal Gauss map in number theory Gaussian moat Gauss class number problem Gauss's multiplication formula Gaussian period Gaussian rational
List of things named after Carl Friedrich Gauss
List_of_things_named_after_Carl_Friedrich_Gauss
Potential counterexample to the generalized Riemann hypothesis
D | ) − 1 {\textstyle h(D)\gg {\sqrt {|D|}}(\log |D|)^{-1}} (see Class number problem for comparison). This can be extended to an equivalence, as it is
Siegel_zero
Method for solving one problem using another
second problem and calling the subroutine one or more times. If both the time required to transform the first problem to the second and the number of times
Polynomial-time_reduction
Unsolved problem in computational complexity theory
time. There are a number of classes of mathematical objects for which the problem of isomorphism is a GI-complete problem. A number of them are graphs
Graph_isomorphism_problem
Mathematical problem involving optimal stopping theory
known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem. Its solution is also
Secretary_problem
Criterion for existence of polynomial roots
Heegner's lemma is a lemma used by Kurt Heegner in his paper on the class number problem. His lemma states that if y 2 = a 4 x 4 + a 3 x 3 + a 2 x 2 + a 1
Heegner's_lemma
NP-hard problem in combinatorial optimization
exponentially) with the number of cities. The problem was first formulated in 1930 and is one of the most intensively studied problems in optimization. It
Travelling_salesman_problem
1998 short novel by Philibert Schogt
believes he has solved one of the great problems of mathematics: "Beauregard's Wild Number Problem" (a fictitious problem invented by Schogt for the novel)
The_Wild_Numbers
Mathematical and computational problem
The bin packing problem is an optimization problem, in which items of different sizes must be packed into a finite number of bins or containers, each
Bin_packing_problem
complement problem. For example, one important problem is whether a number is a prime number. Its complement is to determine whether a number is a composite
Complement_(complexity)
Iwaniec, Henryk (2002). "Spacing of zeros of Hecke L-functions and the class number problem". Acta Arithmetica. 103 (3): 259–312. arXiv:math/0111012. Bibcode:2002AcAri
Grand_Riemann_hypothesis
Class of problems solvable in polynomial time
as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can be solved by a deterministic Turing machine using
P_(complexity)
Subset of a graph's nodes such that all other nodes link to at least one
neighbor in D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. The dominating set problem concerns testing whether
Dominating_set
Unsolved problem in extremal graph theory
Unsolved problem in mathematics What is the largest possible number of edges in a bipartite graph that has a given number of vertices and has no complete
Zarankiewicz_problem
Concept in theoretical computer science
analysis. Definition of the class RTM - Reversal Turing Machines, simple and strong subclass of the TMs. "The Busy Beaver Problem: A New Millennium Attack"
Busy_beaver
Abstract machine used to study decision problems
of a certain problem R {\displaystyle R} in a single operation. The problem R {\displaystyle R} can be of any complexity class, or it can even
Oracle_machine
Category of mathematical proof
Lindemann's proof in 1882, which showed that the problem of squaring the circle cannot be solved because the number π is transcendental (i.e., non-algebraic)
Proof_of_impossibility
Generalization of "n-th" to infinite cases
(α + 1)-th number class is the cardinality immediately following that of the α-th number class. For a limit ordinal α, the α-th number class is the union
Ordinal_number
Odd number with specific properties
set. Unsolved problem in mathematics Is 78,557 the smallest Sierpiński number? More unsolved problems in mathematics The Sierpiński problem asks for the
Sierpiński_number
Type of prime number
{\displaystyle e^{-1/2}} ? More unsolved problems in mathematics In number theory, a regular prime is a special kind of prime number, defined by Ernst Kummer in 1850
Regular_prime
Physics problem related to laws of motion and gravity
In physics, specifically classical mechanics, the three-body problem is to take the initial positions and velocities (or momenta) of three point masses
Three-body_problem
Natural number
the other hand, every odd number greater than one is the sum of at most five prime numbers (as a lower limit). Unsolved problem in mathematics Is 5 the
5
On solvability of Diophantine equations
Hilbert's tenth problem is the tenth on the list of mathematical problems that the German mathematician David Hilbert posed in 1900. It is the challenge
Hilbert's_tenth_problem
Partition of a graph's nodes into cliques
graphs, which are also classes of perfect graphs. The clique cover problem remains NP-complete on some other special classes of graphs, including the
Clique_cover
Problem in computer science
In computability theory, the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program
Halting_problem
Process of achieving a goal by overcoming obstacles
Problem solving is the process of achieving a goal by overcoming obstacles, a frequent part of most activities. Problems in need of solutions range from
Problem_solving
Branch of computational complexity theory
NP-hard problems on a finer scale than in the classical setting, where the complexity of a problem is only measured as a function of the number of bits
Parameterized_complexity
Set of objects whose state must satisfy limits
Constraint satisfaction problems (CSPs) are mathematical questions defined as a set of objects whose state must satisfy a number of constraints or limitations
Constraint satisfaction problem
Constraint_satisfaction_problem
Proposed American battleship class
Isaac (3 September 2025). "The U.S. Navy's Zumwalt-Class Destroyers Have a 'Battleship' Problem". National Security Journal. Archived from the original
Trump-class_battleship
Mathematical problem
The Sleeping Beauty problem, also known as the Sleeping Beauty paradox, is a puzzle in decision theory in which an ideally rational epistemic agent is
Sleeping_Beauty_problem
Conjecture on zeros of the zeta function
consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the
Riemann_hypothesis
American mathematician (born 1947)
solution of Gauss's class number problem for imaginary quadratic fields. Specifically, he proved an effective lower bound for the class number of an imaginary
Dorian_M._Goldfeld
American mathematician
along with being an ingredient to Dorian Goldfeld's solution of the class number problem. As a part of their work, Gross and Zagier found a formula for norms
Don_Zagier
Class of problems in computer science
In complexity theory, PP, or PPT is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability
PP_(complexity)
Thought experiment
The Two Generals' Problem appears often as an introduction to the more general Byzantine Generals problem in introductory classes about computer networking
Two_Generals'_Problem
Class in computational complexity theory
complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be reduced to it by
P-complete
Problem of counting solutions to logic formulas
the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretations that satisfy
♯SAT
Combinatorial optimization problem
problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows: The problem instance has a number of
Assignment_problem
Model theory concept
spectrum problem for countable theories in uncountable cardinalities. If T is a countable complete theory, then the number I(T, ℵα) of isomorphism classes of
Spectrum_of_a_theory
Adding edges to make a graph Hamiltonian
The Hamiltonian completion problem is to find the minimal number of edges to add to a graph to make it Hamiltonian. The problem is clearly NP-hard in the
Hamiltonian_completion
Subset of a graph's vertices, including at least one endpoint of every edge
cover problem can be formulated as the following integer linear program (ILP). This ILP belongs to the more general class of ILPs for covering problems. The
Vertex_cover
On short connecting nets with added points
the Steiner tree problem, or minimum Steiner tree problem, named after Jakob Steiner, is an umbrella term for a class of problems in combinatorial optimization
Steiner_tree_problem
Methodic assignment of colors to elements of a graph
algorithmic problem since the early 1970s: the chromatic number problem (see section § Vertex coloring below) is one of Karp's 21 NP-complete problems from 1972
Graph_coloring
Problem of inverting exponentiation in groups
known algorithm for solving the discrete logarithm problem in general, the first three steps of the number field sieve algorithm only depend on the group
Discrete_logarithm
Determining whether a knot is the unknot
is to determine if the problem admits a polynomial time algorithm; that is, whether the problem lies in the complexity class P. First steps toward determining
Unknotting_problem
Assignment of colors to edges of a graph
case of simple graphs (for which μ(G) = 1). Because the problem of testing whether a graph is class 1 is NP-complete, there is no known polynomial time algorithm
Edge_coloring
Complexity class (logarithmic space)
known as LSPACE, LOGSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using
L_(complexity)
Complexity class of problems
complexity, problems that are in the complexity class NP but are neither in the class P nor NP-complete are called NP-intermediate, and the class of such
NP-intermediate
Concept in computer science
science, bounded-error probabilistic polynomial time (BPP) is the class of decision problems solvable by a probabilistic Turing machine in polynomial time
BPP_(complexity)
Mathematical problem
gallery, what is the minimum number of guards who together can observe the whole gallery?" In the geometric version of the problem, the layout of the art gallery
Art_gallery_problem
Problem in machine learning and statistical classification
classification is the problem of classifying instances into one of three or more classes (classifying instances into one of two classes is called binary classification)
Multiclass_classification
Subset of a graph's edges
cover problem is the problem of finding an edge cover of minimum size. It is an optimization problem that belongs to the class of covering problems and
Edge_cover
Yes-or-no question that cannot ever be solved by a computer
that, via a specific Gödel numbering, correspond to inputs that satisfy the decision problem's criteria. A decision problem A is called decidable or effectively
Undecidable_problem
complexity theory, the complexity class E L E M E N T A R Y {\displaystyle {\mathsf {ELEMENTARY}}} consists of the decision problems that can be solved in time
ELEMENTARY
Describes the objects of a given type, up to some equivalence
object is equivalent to exactly one class. A few issues related to classification are the following. The equivalence problem is "given two objects, determine
Classification_theorem
German mathematician (1908–1975)
named in his honour. Biography portal Class number problem Deuring–Heilbronn phenomenon Heilbronn triangle problem Heilbronn set Heilbronn Institute for
Hans_Heilbronn
Problem in physics and celestial mechanics
In physics, the n-body problem is the problem of predicting the individual motions of a group of celestial objects interacting with each other gravitationally
N-body_problem
Area of discrete mathematics
arbitrary genus. Tait's reformulation generated a new class of problems, the factorization problems, particularly studied by Petersen and Dénes Kőnig. The
Graph_theory
Complexity class
computational complexity theory, RE (recursively enumerable) is the class of decision problems for which a 'yes' answer can be verified by a Turing machine in
RE_(complexity)
Mathematical problem concerning limit cycles in dynamical systems
asks whether there is a bounded number of "Gulf Streams". The problem is historically related to Hilbert's sixteenth problem and was first formulated by Russian
Hilbert–Arnold_problem
Problem about mathematical number fields
Hilbert's twelfth problem is the extension of the Kronecker–Weber theorem on abelian extensions of the rational numbers, to any base number field. It is one
Hilbert's_twelfth_problem
Problem of finding a cycle through all vertices of a graph
Hamiltonian cycle. The Hamiltonian path problem and the Hamiltonian cycle problem belong to the class of NP-complete problems, as shown in Michael Garey and David
Hamiltonian_path_problem
On divisibility among sets of integers
In number theory, Znám's problem asks which sets of integers have the property that each integer in the set is a proper divisor of the product of the
Znám's_problem
Root of a quadratic polynomial with a unit leading coefficient
(see Stark–Heegner theorem). This is a special case of the famous class number problem. There are many known positive integers D > 0 for which the ring
Quadratic_integer
CLASS NUMBER-PROBLEM
CLASS NUMBER-PROBLEM
Surname or Lastname
English
English : occupational name for a summoner, an official who was responsible for ensuring the appearance of witnesses in court, Middle English sumner, sumnor.William Sumner came to Dorchester, MA, from England in about 1635. His descendants include U.S. Senator Charles Sumner, a major force in the struggle to end slavery, who was born in 1811 in Boston.
Surname or Lastname
English
English : from the medieval female personal name Cass, a short form of Cassandra. This was the name (of uncertain, possibly non-Greek, origin) of an ill-fated Trojan prophetess of classical legend, condemned to foretell the future but never be believed; her story was well known and widely popular in medieval England.
Male
German
Short form of German Niclaus, CLAUS means "victor of the people."Â
Boy/Male
Greek Latin
People's victory.
Female
English
English short form of Latin Cassandra, CASS means "she who entangles men."Â
Girl/Female
American, Arabic, Australian, British, Chinese, English, Hebrew
The Warmest Season of the Year; Summer Season; Name of the Season; Summer; The Hot Season of the Year
Girl/Female
English American
Born during the summer.
Surname or Lastname
English
English : from the medieval personal name Classe, a short form of Nicholas. See also Clayson.Variant of Klaas or Klass, North German forms of Claus.
Surname or Lastname
English
English : perhaps a variant of Pamber, a habitational name from a place in Hampshire named Pamber, from Old English penn ‘fold’, ‘enclosure’ + beorg ‘hill’.
Male
English
English form of Norman Germanic Huncberct, possibly HUMBERT means "bright support."Â
Girl/Female
Muslim American Arabic English Gaelic
Jewel. Amber stone.
Surname or Lastname
English
English : variant of Close 1.German : variant of Kloss.
Surname or Lastname
English
English : habitational name from any of the various places so called from their situation on a stream with this name. Humber is a common prehistoric river name, of uncertain origin and meaning.
Surname or Lastname
English and German
English and German : metonymic occupational name for a glazier or glass blower, from Old English glæs ‘glass’ (akin to Glad, referring originally to the bright shine of the material), Middle High German glas.Irish and Scottish : Anglicized form of the epithet glas ‘gray’, ‘green’, ‘blue’ or any of various Gaelic surnames derived from it.German : altered form of the personal name Klass, a reduced form of Nikolaus (see Nicholas).Jewish (Ashkenazic) : ornamental name from German Glass ‘glass’, or a metonymic occupational name for a glazier or glass blower.
Female
Native American
Native American Algonquin name NUMEES means "sister."
Surname or Lastname
English
English : nickname from Old French, Middle English cras ‘big’, ‘fat’ (Latin crassus).Possibly an altered spelling of German Krass.
Female
English
English name derived from the vocabulary word, summer, from Old English sumor, SUMMER means "summer," the hot season of the year.
Boy/Male
Hindu, Indian
Number
Male
German
German byname BAMBER means "short and fat."Â
Surname or Lastname
North German
North German : topographic name from Middle Low German plas ‘place’, ‘open square’, ‘street’.South German (also Pläss) : from a short form of the medieval personal name Blasius.English : variant of Place 3.
CLASS NUMBER-PROBLEM
CLASS NUMBER-PROBLEM
CLASS NUMBER-PROBLEM
CLASS NUMBER-PROBLEM
CLASS NUMBER-PROBLEM
CLASS NUMBER-PROBLEM
CLASS NUMBER-PROBLEM