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
Deciding finiteness of matrix groups in deterministic polyn..:
, In:
Proceedings of the 1993 international symposium on Symbolic and algebraic computation
,
Babai, László
;
Beals, Robert
;
Rockmore, Daniel
- p. 117-126 , 1993
Link:
https://dl.acm.org/doi/10.1145/164081.164104
RT T1 <cTitle>Proceedings of the 1993 international symposium on Symbolic and algebraic computation</cTitle>: T1 <Title>Deciding finiteness of matrix groups in deterministic polynomial time</Title> UL https://suche.suub.uni-bremen.de/peid=acm-164104&Exemplar=1&LAN=DE A1 Babai, László A1 Beals, Robert A1 Rockmore, Daniel PB ACM YR 1993 K1 Computing methodologies K1 Symbolic and algebraic manipulation K1 Symbolic and algebraic algorithms K1 Algebraic algorithms K1 Theory of computation K1 Computational complexity and cryptography K1 Complexity classes K1 Mathematics of computing K1 Probability and statistics K1 Probabilistic reasoning algorithms K1 Random number generation SP 117 OP 126 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/164081.164104 DO https://dl.acm.org/doi/10.1145/164081.164104 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
