Advertisement

Nontrivial lower bounds for some NP-problems on directed graphs

  • Solomampionona Ranaivoson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 533)

Abstract

NP-complete problems are believed to be not in P. But only a very few NP-complete problems, and none concerning graph theory, are proved to have a nontrivial time lower bound (i.e. not to be solvable in linear time on a DTM (i.e. deterministic Turing machine). A problem L ε NP is linearly NP-complete if any problem in Ntime (n) can be reduced to it in linear time on a DTM. It follows from the separation result between deterministic and nondeterministic linear-time complexity classes [PPST83], that a linearly NP-complete problem has a nontrivial time lower bound. We present in this paper the first natural problems on graphs which are linearly NP-complete.

Keywords

Singular Point Directed Graph Linear Time Acyclic Directed Graph Turing Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Co87/88]
    S. A. COOK, Short propositional formulas represent nondeterministic computations, Information Processing Letters 26 (1987/88) 269–270, North-Holland.CrossRefGoogle Scholar
  2. [GaJo79]
    M. S. GAREY and D. S. JOHNSON, Computers and Intractability: a Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.Google Scholar
  3. [Gr88]
    E. GRANDJEAN, A natural NP-complete problem with a nontrivial lower bound, SIAM J. Comput., 1988.Google Scholar
  4. [Gr90]
    E. GRANDJEAN, A nontrivial lower bound for an NP problem on Automata, SIAM J. Comput., 1990. pp. 438–451.Google Scholar
  5. [Gr90b]
    E. GRANDJEAN, personal communication, 1990Google Scholar
  6. [Ha65]
    F. HARARY, An introduction to the theory of directed graphs, John Wiley and Sons, 1965.Google Scholar
  7. [Ly90]
    J. F. LYNCH, The quantifier structure of sentences that characterize non-deterministic time-complexity, Logic in computer science, Proceeding colloquium, July 1990.Google Scholar
  8. [Pf73]
    C. P. PFLEEGER, State reduction in incompletely specified sequential switching functions, IRE Trans. Electron. Comput EC-8 (1959), 356–367.Google Scholar
  9. [PPST83]
    W. J. PAUL, N. PIPPENGER, E. SZEMERDI and W. T. TROTTER, On determinism versus nondeterminism and related problems, Proc 24 th IEEE Symp. On Foundations of Computer Science. IEE (1983), 428–438.Google Scholar
  10. [Ra90]
    S. RANAIVOSON, bornes inférieures non triviales pour des problèmes NP en théorie des graphes et des automates, thèse de doctorat, laboratoire d'informatique de l'université de CaenGoogle Scholar
  11. [Ro87]
    M. de Rougemont, Second-order and inductive definability on finite structures, Zeitschr. f. math. Logik und Grundalgen d. Math. 33 (1987), 47–63.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Solomampionona Ranaivoson
    • 1
  1. 1.Laboratoire d'Informatique de l'Université de CaenCaen cedexFrance

Personalised recommendations