Discrete Computation: Theory and Open Problems
Complexity 1. Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. Aho, ed., Prentice-Hall, Englewood Cliff, N.J., 1973,pp.32-89.
Main Author: | Meyer, Albert R. |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/148868 |
Similar Items
-
Current Open Problems in Discrete and Computational Geometry
by: H. Edelsbrunner, et al.
Published: (2015-03-01) -
Current Open Problems in Discrete and Computational Geometry
by: H. Edelsbrunner, et al.
Published: (2012-01-01) -
Schaum's outline of theory and problems of discrete mathematics /
by: 361304 Lipschutz, Seymour, et al.
Published: (1997) -
Schaum's outline of theory and problems of discrete mathematics /
by: 361304 Lipschutz, Seymour
Published: (1976) -
Discrete Morse theory for computing cellular sheaf cohomology
by: Curry, J, et al.
Published: (2015)