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
Robustness of average-case meta-complexity via pseudorandom..:
, In:
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
,
Ilango, Rahul
;
Ren, Hanlin
;
Santhanam, Rahul
- p. 1575-1583 , 2022
Link:
https://dl.acm.org/doi/10.1145/3519935.3520051
RT T1 <cTitle>Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing</cTitle>: T1 <Title>Robustness of average-case meta-complexity via pseudorandomness</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3520051&Exemplar=1&LAN=DE A1 Ilango, Rahul A1 Ren, Hanlin A1 Santhanam, Rahul PB ACM YR 2022 K1 Kolmogorov complexity K1 average-case complexity K1 coding theorem K1 meta-complexity K1 minimum circuit size problem K1 one-way functions K1 Theory of computation K1 Pseudorandomness and derandomization K1 Problems, reductions and completeness K1 Circuit complexity K1 Cryptographic primitives SP 1575 OP 1583 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3519935.3520051 DO https://dl.acm.org/doi/10.1145/3519935.3520051 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
