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
KRW Composition Theorems via Lifting:
, In:
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
,
de Rezende, Susanna F.
;
Meir, Or
;
Nordstrom, Jakob
.. - p. 43-49 , 2020
Link:
https://doi.org/10.1109/FOCS46700.2020.00013
RT T1
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
: T1
KRW Composition Theorems via Lifting
UL https://suche.suub.uni-bremen.de/peid=ieee-9317931&Exemplar=1&LAN=DE A1 de Rezende, Susanna F. A1 Meir, Or A1 Nordstrom, Jakob A1 Pitassi, Toniann A1 Robere, Robert YR 2020 SN 2575-8454 K1 Complexity theory K1 Protocols K1 Mathematical model K1 Computer science K1 Search problems K1 Upper bound K1 Task analysis K1 KRW K1 Lifting K1 Simulation K1 Karchmer-Wigderson relations K1 KW relations K1 circuit complexity K1 circuit lower bounds K1 formula complexity K1 formula lower bounds K1 depth complexity K1 depth lower bounds K1 communication complexity SP 43 OP 49 LK http://dx.doi.org/https://doi.org/10.1109/FOCS46700.2020.00013 DO https://doi.org/10.1109/FOCS46700.2020.00013 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)