Article
Licensed
Unlicensed
Requires Authentication
Optimal search of extremums of convex functions on lattices
-
M. M. KOVALEV
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1992
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On the edge-independence number and edge-covering number for regular graphs
- Systems of antiprefix equations in words
- On word colourings and some perfect graphs
- Optimal search of extremums of convex functions on lattices
- The completeness modulo ideal in functional systems of a program type
- On the solution of systems of automaton equations
- Some conditional distributions for random graphs
- Randomized decomposable statistics in the scheme of independent allocating particles into boxes
- On the number of cycles in a random non-equiprobable graph
Articles in the same Issue
- On the edge-independence number and edge-covering number for regular graphs
- Systems of antiprefix equations in words
- On word colourings and some perfect graphs
- Optimal search of extremums of convex functions on lattices
- The completeness modulo ideal in functional systems of a program type
- On the solution of systems of automaton equations
- Some conditional distributions for random graphs
- Randomized decomposable statistics in the scheme of independent allocating particles into boxes
- On the number of cycles in a random non-equiprobable graph
