Computation and Complexity
Abstract
Algorithmics, computation, optimization, complexity, combinatorics and knowledge representation are closely related sub-areas of Theoretical Computer Science. The following summary presents short descriptions of the twelve chapters in this topical part.
References
[1]
Agarwal, P., Ezra, E., Fox, K.: Geometric optimization revisited. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 66–84. Springer, Cham (2018)
[2]
Aziz, H., Brandt, F., Elkind, E., Skowron, P.: Computational social choice: the first ten years and beyond. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 48–65. Springer, Cham (2018)
[3]
Bartholdi, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welf. 6, 157–165 (1989)
[4]
Binucci, C., et al.: Ten reasons to get interested in graph drawing. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 85–104. Springer, Cham (2018)
[5]
Cook, W.: Computing in combinatorial optimization. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 27–47. Springer, Cham (2018)
[6]
de Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77974-2
[7]
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987). https://doi.org/10.1007/978-3-642-61568-9
[8]
Halldorsson, M., Wattenhofer, R.: Wireless network algorithmics. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 141–160. Springer, Cham (2018)
[9]
Impagliazzo, R., Paturi, R.: The complexity of k-SAT. In: Proceedings of the 14th IEEE Conference on Computational Complexity, pp. 237–240 (1999)
[10]
Maass, W., Papadimitriou, C., Vempala, S., Legenstein, R.: Brain computation: a computer science perspective. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 184–199. Springer, Cham (2018)
[11]
Mandjes, M., Starreveld, N., Bekker, R., Spreij, P.: Dynamic Erdős-Rényi graphs. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 123–140. Springer, Cham (2018)
[12]
Pruhs, K.: Green computing algorithmics. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 161–183. Springer, Cham (2018)
[13]
Regan, K.: Rating computer science via chess. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 200–216. Springer, Cham (2018)
[14]
Ron, D.: Sublinear-time algorithms for approximating graph parameters. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 105–122. Springer, Cham (2018)
[15]
Weikum, G., Hoffart, J., Suchanek, F.: Knowledge harvesting: achievements and challenges. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 217–235. Springer, Cham (2018)
[16]
Williams, R.: Some estimated likelihoods for computational complexity. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 9–26. Springer, Cham (2018)
Index Terms
- Computation and Complexity
Index terms have been assigned to the content through auto-classification.
Recommendations
Computational Complexity in Non-Turing Models of Computation
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, 'Computational Complexity in Non-Turing Models of Computation'. Based on investigation of a motivating example, we argue that traditional ...
Kolmogorov Complexity for Possibly Infinite Computations
In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired ...
Comments
Information & Contributors
Information
Published In
603 pages
Copyright © 2019 Springer Nature Switzerland AG.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 11 March 2022
Qualifiers
- Chapter
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in