home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory
- Path: sparky!uunet!cs.utexas.edu!torn!watserv1!watmath!neumann.waterloo.edu!alopez-o
- From: alopez-o@neumann.waterloo.edu (Alex Lopez-Ortiz)
- Subject: Re: Lower bound independence
- Message-ID: <1992Jul24.182855.25240@math.waterloo.edu>
- Keywords: NP, independence
- Sender: news@math.waterloo.edu (News Owner)
- Organization: University of Waterloo
- References: <1992Jul23.204321.4615@math.waterloo.edu> <1992Jul24.155959.26446@cs.rochester.edu>
- Date: Fri, 24 Jul 1992 18:28:55 GMT
- Lines: 27
-
- In article <1992Jul24.155959.26446@cs.rochester.edu>, fulk@cs.rochester.edu (Mark Fulk) writes:
- > In article <1992Jul23.204321.4615@math.waterloo.edu> alopez-o@neumann.waterloo.edu (Alex Lopez-Ortiz) writes:
- > >I recall reading about a proof that there exists a problem of complexity
- > >n^2 for which only an exponential lower bound could ever be proven
- > >within some formal system. Iread the note in a survey.
- >
- > You clearly have this wrong, since an n^2 problem could not have an
- > exponential lower bound.
-
- Yes, it is a typo, I meant to write upper bound.
-
- > I suspect that you are referring to work
- > of Case and Royer, which shows the existence, for any reasonable formal
- > system F, of a problem that is in linear time, provable in F to be in
- > quadratic time (a clocked TM is supplied), but not provable in F to be
- > in linear time. The proof is a fairly straightforward diagonalization.
- > For details and references, you might email royer@top.cis.syr.edu
- >
- > Mark
- > --
- > Mark A. Fulk University of Rochester
- > Computer Science Department fulk@cs.rochester.edu
-
- --
- Alex Lopez-Ortiz alopez-o@maytag.UWaterloo.ca
- Deparment of Computer Science University of Waterloo
- Waterloo, Ontario Canada
-