OpenAlex
PricingAboutJobs
Log inGet started
Work

Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems

HTML

Year: 2014
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/focs.2014.53
Authors: Amir Abboud, Virginia Vassilevska Williams
Institution: Stanford University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: dynamic algorithms, lower bounds, CNF satisfiability, all-pairs shortest paths, triangle detection, Boolean matrix multiplication, single-source shortest path, strong connectivity, conditional lower bounds

Open Access status: closed
OpenAlex ID: W2146507303
FWCI: 17.03
Cites: 52
Cited by: 485
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms