Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Computation and complexity

From MaRDI portal
Publication:2075759
Jump to:navigation, search

DOI10.1007/978-3-319-91908-9_1zbMATH Open1482.68159OpenAlexW2977826822MaRDI QIDQ2075759

Gerhard J. Woeginger

Publication date: 16 February 2022


Full work available at URL: https://doi.org/10.1007/978-3-319-91908-9_1




Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Knowledge representation (68T30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)



Related Items (5)

Computational complexity and feasibility of data processing and interval computations ⋮ Title not available (Why is that?) ⋮ Complexity theory ⋮ Complexity analysis and its application ⋮ Computability, complexity and economics






This page was built for publication: Computation and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2075759)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2075759&oldid=14568824"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 22:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki