Re: HLA v1.68 is now available
From: Alex McDonald (alex_mcd_at_btopenworld.com)
Date: 07/28/04
- Next message: Betov: "Re: HLA v1.68 is now available"
- Previous message: Annie: "Re: f0dder's fabulous folly."
- In reply to: Randall Hyde: "Re: HLA v1.68 is now available"
- Next in thread: Betov: "Re: HLA v1.68 is now available"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Wed, 28 Jul 2004 07:48:40 +0000 (UTC)
"Randall Hyde" <randyhyde@earthlink.net> wrote in message
news:qMBNc.529$9Y6.141@newsread1.news.pas.earthlink.net...
>
> "Alex McDonald" <alex_mcd@btopenworld.com> wrote in message news:ce6jj8
> >
> > Randy has indicated (another part of this thread) that this is an
> > NP-complete problem; I'm not in agreement with him here, as I think it's
a
> > cost-based variation of transitive closure, where each basic block is a
> node
> > on the graph and the cost is the jump distance. The minimal algorithm is
> > P-complete and requires one pass; however, it's a second pass over the
> > data -- hence two passes needed for your assembler. I'm willing to be
> proved
> > wrong on this one, btw.
>
> Alex, this is a very *old* proof. 70's or 80's as I recall.
> You might want to read the following, as it provides a pretty good
> explanation of this:
> http://www.masmforum.com/viewtopic.php?t=1734
>
I stand corrected.
-- Regards Alex McDonald
- Next message: Betov: "Re: HLA v1.68 is now available"
- Previous message: Annie: "Re: f0dder's fabulous folly."
- In reply to: Randall Hyde: "Re: HLA v1.68 is now available"
- Next in thread: Betov: "Re: HLA v1.68 is now available"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
|