Amanote Research

Amanote Research

    RegisterSign In

Finding a Heaviest Vertex-Weighted Triangle Is Not Harder Than Matrix Multiplication

SIAM Journal on Computing - United States
doi 10.1137/070695149
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer Science
Date

January 1, 2009

Authors
Artur CzumajAndrzej Lingas
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Concurrent Counting Is Harder Than Queuing

2006English

Computer Simulation of Phase Decomposition Process Generating Precipitates Harder Than Matrix

Materials Transactions, JIM
1996English

Work Harder, Not Smarter

Journal of Thoracic and Cardiovascular Surgery
Respiratory MedicinePulmonaryCardiovascular MedicineSurgeryCardiology
2019English

Finding Vertex-Surjective Graph Homomorphisms

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2012English

Vertex Degree Weighted Path Indices

Acta Chimica Slovenica
Chemistry
2016English

Singularities of the Triangle Diagram Vertex Function

Australian Journal of Physics
1973English

Enhanced Matrix Chain Multiplication

Journal of Cyber Security and Mobility
HardwareComputer NetworksArchitectureCommunications
2018English

Birds Do Not Work Harder to Breathe

Journal of Experimental Biology
EvolutionEcologyInsect ScienceMolecular BiologySystematicsAnimal ScienceMedicineAquatic ScienceBehaviorZoologyPhysiology
2017English

Fast Sparse Matrix Multiplication

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy