Priporočene teme znotraj vašega iskanja.
Priporočene teme znotraj vašega iskanja.
Poišči alternative:
communication test » communications test, communication text, communication best
euclidean graphs » euclidean spaces, euclidean group, euclidean rings
euclidean gibbs » euclidean rings, euclidean logics
test counting » nest counting, fast counting, testing counting
communication test » communications test, communication text, communication best
euclidean graphs » euclidean spaces, euclidean group, euclidean rings
euclidean gibbs » euclidean rings, euclidean logics
test counting » nest counting, fast counting, testing counting
1
Izdano 2010
Kazalo:
“... of Approximately Counting Stable Matchings -- Constant Approximation Algorithms for Embedding Graph Metrics...”Polni tekst
Elektronski
eKnjiga
2
Izdano 2008
Kazalo:
“... -- Stabbing Convex Polygons with a Segment or a Polygon -- An Efficient Algorithm for 2D Euclidean 2-Center...”Polni tekst
Elektronski
eKnjiga
3
Izdano 2008
Kazalo:
“... Sequences of Random Outerplanar and Series-Parallel Graphs -- Improved Bounds for Testing Juntas...”Polni tekst
Elektronski
eKnjiga