home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.math:9460 sci.math.num-analysis:2279 sci.math.symbolic:2058
- Newsgroups: sci.math,sci.math.num-analysis,sci.math.symbolic
- Path: sparky!uunet!gatech!usenet.ins.cwru.edu!agate!linus!linus.mitre.org!fatima!bs
- From: bs@fatima.mitre.org (Robert D. Silverman)
- Subject: Re: Lattice points in a polytope? (How to find all of them?)
- Message-ID: <1992Jul23.160552.6153@linus.mitre.org>
- Keywords: polytope, integer points
- Sender: news@linus.mitre.org (News Service)
- Nntp-Posting-Host: fatima.mitre.org
- Organization: Research Computer Facility, MITRE Corporation, Bedford, MA
- References: <BruKLH.DBz@watdragon.waterloo.edu>
- Date: Thu, 23 Jul 1992 16:05:52 GMT
- Lines: 28
-
- In article <BruKLH.DBz@watdragon.waterloo.edu> xjzhu@jeeves.waterloo.edu (Xiao Jun Zhu) writes:
- :Hi, there:
- :
- : I am in need of an efficient program or algorithm(prefer in C) which can
- :find all the integer points in a polytope defined by sets of inequalities.
- :(Suppose that I know that the number of lattice points is not so huge.)
- :If you know such a thing exists, please send a message to me. Thanks very
- :much for your help.
-
- There are probabalistic methods that work in polynomial time (in RP).
- However, they only give approximate answers.
-
- If you need an exact answer I'm afraid that the problem is NP-Complete.
- There is no 'efficient' way of doing it.
-
- See, for example,
-
- Theory of Linear and Integer Programming
- Alexander Schrijver
- John Wiley & Sons. ISBN 0 471 90854 1
-
- I might also suggest Schrijver's book Polyhedral Combinatorics
-
- --
- Bob Silverman
- These are my opinions and not MITRE's.
- Mitre Corporation, Bedford, MA 01730
- "You can lead a horse's ass to knowledge, but you can't make him think"
-