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
Constant Depth Circuit Complexity for Generating Quasigroup:
, In:
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation
,
Collins, Nathaniel A.
;
Grochow, Joshua A.
;
Levet, Michael
. - p. 198-207 , 2024
Link:
https://dl.acm.org/doi/10.1145/3666000.3669691
RT T1 <cTitle>Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation</cTitle>: T1 <Title>Constant Depth Circuit Complexity for Generating Quasigroups</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3669691&Exemplar=1&LAN=DE A1 Collins, Nathaniel A. A1 Grochow, Joshua A. A1 Levet, Michael A1 Weiß, Armin PB ACM YR 2024 K1 Circuit Complexity K1 Constant-Depth Circuits K1 Group Isomorphism K1 Membership Testing K1 Minimum Generating Set K1 Quasigroup Isomorphism K1 quasiAC0 K1 Theory of computation K1 Computational complexity and cryptography K1 Circuit complexity K1 Mathematics of computing K1 Discrete mathematics K1 Algebraic complexity theory SP 198 OP 207 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3666000.3669691 DO https://dl.acm.org/doi/10.1145/3666000.3669691 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
