I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Hardness of approximation in p via short cycle removal: cyc..:
, In:
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
,
Abboud, Amir
;
Bringmann, Karl
;
Khoury, Seri
. - p. 1487-1500 , 2022
Link:
https://dl.acm.org/doi/10.1145/3519935.3520066
RT T1 <cTitle>Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing</cTitle>: T1 <Title>Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3520066&Exemplar=1&LAN=DE A1 Abboud, Amir A1 Bringmann, Karl A1 Khoury, Seri A1 Zamir, Or PB ACM YR 2022 K1 4-Cycle Finding K1 Fine-Grained Complexity K1 Hardness of Approximation K1 Shortest Paths K1 Triangle Finding K1 Theory of computation K1 Graph algorithms analysis K1 Approximation algorithms analysis K1 Shortest paths SP 1487 OP 1500 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3519935.3520066 DO https://dl.acm.org/doi/10.1145/3519935.3520066 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
