Algorithms and Complexity

Bogdan Grechuk
Additional contact information
Bogdan Grechuk: University of Leicester, Department of Mathematics

Chapter Chapter 7 in Landscape of 21st Century Mathematics, 2021, pp 303-342 from Springer

Abstract: Abstract This chapter presents a collection of theorems in algorithms and complexity, proved in the twenty-first century, which are at the same time great and easy to understand. The chapter is written for undergraduate and graduate students interested in algorithms and complexity, as well as for mathematicians working in other areas of mathematics, who would like to learn about recent achievements in algorithms and complexity without going into technical details.

Date: 2021
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-80627-9_7

Ordering information: This item can be ordered from
http://www.springer.com/9783030806279

DOI: 10.1007/978-3-030-80627-9_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().