Publikation: Joseph M. Landsberg: Geometry and complexity theory [Rezension]
Lade...
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2020
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Bulletin of the American Mathematical Society. American Mathematical Society (AMS). 2020, 57(2), pp. 317-324. ISSN 0002-9904. eISSN 1088-9485. Available under: doi: 10.1090/bull/1661
Zusammenfassung
Can algebra be applied to prove nonexistence of certain algorithms? Can geometry be used to provide nonconstructive solutions to complexity problems? Landsberg’s book provides positive answers to these questions, focusing on two central, famous open problems: determine if P is equal to NP, and what is the complexity of matrix multiplication.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
510 Mathematik
Schlagwörter
Konferenz
Rezension
Geometry and complexity theory / Landsberg, Joseph M.. - Cambridge: Cambridge University Press, 2017. - (Cambridge studies in advanced mathematics; 169). - ISBN 978-1-107-19923-1. - 10.1017/9781108183192
Zitieren
ISO 690
MICHALEK, Mateusz, 2020. Joseph M. Landsberg: Geometry and complexity theory. In: Bulletin of the American Mathematical Society. American Mathematical Society (AMS). 2020, 57(2), pp. 317-324. ISSN 0002-9904. eISSN 1088-9485. Available under: doi: 10.1090/bull/1661BibTex
@article{Michalek2020Josep-53285, year={2020}, doi={10.1090/bull/1661}, title={Joseph M. Landsberg: Geometry and complexity theory}, number={2}, volume={57}, issn={0002-9904}, journal={Bulletin of the American Mathematical Society}, pages={317--324}, author={Michalek, Mateusz}, note={Is Review} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/53285"> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dc:contributor>Michalek, Mateusz</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-03-29T08:40:11Z</dcterms:available> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:abstract xml:lang="eng">Can algebra be applied to prove nonexistence of certain algorithms? Can geometry be used to provide nonconstructive solutions to complexity problems? Landsberg’s book provides positive answers to these questions, focusing on two central, famous open problems: determine if P is equal to NP, and what is the complexity of matrix multiplication.</dcterms:abstract> <dc:rights>terms-of-use</dc:rights> <dc:creator>Michalek, Mateusz</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/53285"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-03-29T08:40:11Z</dc:date> <dcterms:title>Joseph M. Landsberg: Geometry and complexity theory</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dc:language>eng</dc:language> <dcterms:issued>2020</dcterms:issued> </rdf:Description> </rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Ja