Asymptotic properties of combinatorial optimization problems in \(p\)-adic space (Q1760265): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability theory of classical Euclidean optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization problems in ultrametric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: p-adic space-time and string theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(p\)-adic mathematical physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: p-adic Feynman and string amplitudes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 75.9 Euler’s Constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428785 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:26, 5 July 2024

scientific article
Language Label Description Also known as
English
Asymptotic properties of combinatorial optimization problems in \(p\)-adic space
scientific article

    Statements

    Asymptotic properties of combinatorial optimization problems in \(p\)-adic space (English)
    0 references
    0 references
    0 references
    13 November 2012
    0 references
    stochastic combinatorial optimization
    0 references
    \(p\)-adic space
    0 references
    minimum spanning tree
    0 references
    travelling salesman problem
    0 references

    Identifiers