Joseph M. Landsberg: Geometry and complexity theory

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

MICHALEK, Mateusz, 2020. Joseph M. Landsberg: Geometry and complexity theory. In: Bulletin of the American Mathematical Society. American Mathematical Society (AMS). 57(2), pp. 317-324. ISSN 0002-9904. eISSN 1088-9485. Available under: doi: 10.1090/bull/1661

@article{Michalek2020Josep-53285, title={Joseph M. Landsberg: Geometry and complexity theory}, year={2020}, doi={10.1090/bull/1661}, 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 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/rdf/resource/123456789/53285"> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-03-29T08:40:11Z</dcterms:available> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/53285"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dc:contributor>Michalek, Mateusz</dc:contributor> <dc:rights>terms-of-use</dc:rights> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-03-29T08:40:11Z</dc:date> <dc:creator>Michalek, Mateusz</dc:creator> <dcterms:title>Joseph M. Landsberg: Geometry and complexity theory</dcterms:title> <dc:language>eng</dc:language> <dcterms:issued>2020</dcterms:issued> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <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> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account