Efficient algorithms for path system problems and applications to alternating and time-space complexity classes

@article{Sudborough1980EfficientAF,
  title={Efficient algorithms for path system problems and applications to alternating and time-space complexity classes},
  author={Ivan Hal Sudborough},
  journal={21st Annual Symposium on Foundations of Computer Science (sfcs 1980)},
  year={1980},
  pages={62-73}
}
Let SPS(f(n)) denote the solvable path system problem for path systems of bandwidth f(n) and SPS (f(n)) the corresponding problem for monotone systems. Let DTISP (poly, f(n)) denote the polynomial time and simultaneous f(n) space class and SC = UkDTISP (poly, logkn). Let ASPACE (f(n)) denote the sets accepted by f(n) space bounded alternating TMs and ASPACE (f(n)) the corresponding one-way TM family. Then, for "well-behaved" functions fεO(n)-o(log n), (1) SPS (f(n)) is ≤log-complete for DTISP… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Meyer , On time - space classes and their relation to the theory of real addition ,

R. A.
ACM Symp . Theory of Computing • 1978

Complexity results for bandwidth minimization

R. L. Graham, D. S. Johnson, D. E. Knuth
Systems Theory • 1968

Similar Papers

Loading similar papers…