A geometric graph ( = gg) is a pair G = (V, E), where V is a finite set of points ( = vertices) in general position in the plane, and E is a set of open straight line segments ( = edges) whose endpoints are in V. G is a convex gg ( = egg) if V is the set of vertices of a convex polygon. For n 3 1, 0
โฆ LIBER โฆ
Numerical characteristics of systems of straight lines on complete intersections
โ Scribed by A. S. Libgober
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1973
- Tongue
- English
- Weight
- 308 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the intersection of edges of a geomet
โ
N. Alon; M.A. Perles
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 969 KB
On shock waves in the flow of a polytrop
โ
A.F Sidorov
๐
Article
๐
1961
๐
Elsevier Science
๐
English
โ 444 KB
On the stability of the numerical integr
โ
E.N. Sarmin; L.A. Chudov
๐
Article
๐
1963
๐
Elsevier Science
โ 329 KB
Numerical integration approach to on-lin
โ
Setsuo Sagara; Zhen-Yu Zhao
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 926 KB
A discrete-time method is developed for parameter estimation of continuous-time systems. The use of a linear integral filter overcomes the initial condition problem and simplifies the application of the results from discrete-time model identification in continuous-time system identification.
New completely integrable Hamiltonian sy
โ
S. Wojciechowski
๐
Article
๐
1976
๐
Elsevier Science
๐
English
โ 184 KB
Stability of the numerical integration o
โ
A.F. Klement'ev
๐
Article
๐
1969
๐
Elsevier Science
โ 211 KB