Jump to content

Search results

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Thumbnail for Clique problem
    practical for networks comprising more than a few dozen vertices. Although no polynomial time algorithm is known for this problem, more efficient algorithms than...
    84 KB (9,905 words) - 11:45, 12 August 2024
  • Thumbnail for Random graph
    of q colors, called its chromatic polynomial, remains unknown so far. The scaling of zeros of the chromatic polynomial of random graphs with parameters...
    15 KB (2,187 words) - 14:01, 9 January 2024
  • theory), the cardinality of a group or period of an element Order of a polynomial (disambiguation) Order of a square matrix, its dimension Order (ring theory)...
    4 KB (501 words) - 09:50, 19 February 2023
  • Thumbnail for Friendship graph
    number 3 and chromatic index 2n. Its chromatic polynomial can be deduced from the chromatic polynomial of the cycle graph C3 and is equal to ( x − 2 )...
    8 KB (800 words) - 19:15, 26 July 2024
  • problem cannot be solved efficiently (where efficiently typically means "in polynomial time"). It is not known how to prove (unconditional) hardness for essentially...
    27 KB (3,227 words) - 22:38, 20 December 2023
  • graphs have bounded expansion. A closely related but stronger property, polynomial expansion, is equivalent to the existence of separator theorems for these...
    9 KB (982 words) - 04:02, 6 December 2023
  • weight data points to sequentially reduce error. Polynomial chaos expansions, which use orthogonal polynomials to approximate the response surface. Smoothing...
    56 KB (6,945 words) - 08:33, 9 September 2024
  • combinatorics and probability theory. Arratia developed the ideas of interlace polynomials with Béla Bollobás and Gregory Sorkin, found an equivalent formulation...
    7 KB (488 words) - 07:10, 6 May 2024
  • Thumbnail for Theorem
    theorems", is probably due to Alfréd Rényi, although it is often attributed to Rényi's colleague Paul Erdős (and Rényi may have been thinking of Erdős),...
    34 KB (4,394 words) - 21:19, 27 August 2024
  • Thumbnail for Conductance (graph theory)
    to prove that the permanent of a matrix with entries from {0,1} has a polynomial-time approximation scheme. In the proof, Jerrum and Sinclair studied the...
    9 KB (1,407 words) - 00:31, 19 June 2024
  • Thumbnail for Planted clique
    Planted clique (category Quasi-polynomial time algorithms)
    clique problem; it may be solved in quasi-polynomial time but is conjectured not to be solvable in polynomial time for intermediate values of the clique...
    13 KB (1,680 words) - 09:07, 12 August 2024
  • classification and model selection. Marton was also responsible for the polynomial Freiman–Ruzsa conjecture, a central question of additive combinatorics...
    15 KB (1,351 words) - 14:56, 12 June 2024
  • Thumbnail for Time series
    all relevant dates. Alternatively polynomial interpolation or spline interpolation is used where piecewise polynomial functions are fitted in time intervals...
    41 KB (4,900 words) - 02:02, 31 July 2024
  • further conjectured that there exists a nonconstant integer-coefficient polynomial whose values at the natural numbers form a Sidon sequence. Specifically...
    15 KB (1,964 words) - 21:09, 14 September 2024
  • Thumbnail for Gábor Szegő
    generation and made fundamental contributions to the theory of orthogonal polynomials and Toeplitz matrices building on the work of his contemporary Otto Toeplitz...
    13 KB (1,185 words) - 03:12, 14 August 2024
  • numbers Stirling numbers of the second kind Stirling polynomials Random permutation statistics Rényi, Alfred (1962). "Théorie des éléments saillants d'une...
    37 KB (7,201 words) - 09:10, 29 July 2024
  • Thumbnail for Hub (network science)
    of nodes. In scale-free networks the degree of the largest hub rises polynomially with the size of the network. Therefore, the degree of a hub can be high...
    11 KB (1,495 words) - 03:12, 3 December 2023
  • Thumbnail for Component (graph theory)
    the chromatic polynomial of the graph, and the chromatic polynomial of the whole graph can be obtained as the product of the polynomials of its components...
    30 KB (3,441 words) - 12:55, 5 July 2024
  • {\displaystyle H} -free graphs necessarily contain a perfect induced subgraph of polynomial size. This is because every perfect graph necessarily has either a clique...
    10 KB (1,324 words) - 11:20, 8 July 2024
  • Thumbnail for Quantum information
    famous example of this is Shor's algorithm that can factor numbers in polynomial time, compared to the best classical algorithms that take sub-exponential...
    41 KB (4,542 words) - 17:53, 14 May 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)