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
Fundamental Limits of Testing the Independence of Irrelevan..:
, In:
Proceedings of the 2019 ACM Conference on Economics and Computation
,
Seshadri, Arjun
;
Ugander, Johan
- p. 65-66 , 2019
Link:
https://dl.acm.org/doi/10.1145/3328526.3329656
RT T1 <cTitle>Proceedings of the 2019 ACM Conference on Economics and Computation</cTitle>: T1 <Title>Fundamental Limits of Testing the Independence of Irrelevant Alternatives in Discrete Choice</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3329656&Exemplar=1&LAN=DE A1 Seshadri, Arjun A1 Ugander, Johan PB ACM YR 2019 K1 discrete choice K1 iia K1 testing K1 Mathematics of computing K1 Probability and statistics K1 Probabilistic inference problems K1 Hypothesis testing and confidence interval computation K1 Theory of computation K1 Theory and algorithms for application domains K1 Machine learning theory K1 Sample complexity and generalization bounds K1 Discrete mathematics K1 Graph theory K1 Graph enumeration SP 65 OP 66 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3328526.3329656 DO https://dl.acm.org/doi/10.1145/3328526.3329656 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
