Linear Time Algorithms and NP-Complete Problems

@inproceedings{Grandjean1992LinearTA,
  title={Linear Time Algorithms and NP-Complete Problems},
  author={Etienne Grandjean},
  booktitle={CSL},
  year={1992}
}
We define and study a machine model (random access machine with powerful input/output instructions) and show that for this model the classes, DLINEAR and NLINEAR, of problems computable in deterministic (resp. nondeterministic) linear time are robust and powerful. In particular DLINEAR includes most of the concrete problems commonly regarded as computable in linear time (such as graph problems: topological sorting, strong connectivity...) and most combinatorial NP-complete problems belong to… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 25 CITATIONS

A Normal Form for First-Order Logic over Doubly-Linked Data Structures

  • Int. J. Found. Comput. Sci.
  • 2008
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Exact complexity of problems of incompletely specified automata

  • Annals of Mathematics and Artificial Intelligence
  • 1996
VIEW 16 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Orthogonal Discrete Frequency-Coding Waveform Set Design with Minimized Autocorrelation Sidelobes

  • IEEE Transactions on Aerospace and Electronic Systems
  • 2009
VIEW 1 EXCERPT
CITES METHODS

Genetic Algorithm for Designing Polyphase Orthogonal Code

  • 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing
  • 2008
VIEW 1 EXCERPT
CITES BACKGROUND