Evaluating Functions over Lattices

Michael Conlon
Additional contact information
Michael Conlon: University of Florida, Department of Statistics

A chapter in Computing Science and Statistics, 1992, pp 315-317 from Springer

Abstract: Abstract An approach is presented for constructing algorithms to evaluate functions over convex, connected subsets of lattices. The approach produces algorithms that rapidly span the desired subset and uses all possible adjacency information. Every evaluation after the first has information available regarding the value of the function at a neighboring lattice point.

Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2856-1_44

Ordering information: This item can be ordered from
http://www.springer.com/9781461228561

DOI: 10.1007/978-1-4612-2856-1_44

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().