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
When is approximate counting for conjunctive queries tracta..:
, In:
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
,
Arenas, Marcelo
;
Croquevielle, Luis Alberto
;
Jayaram, Rajesh
. - p. 1015-1027 , 2021
Link:
https://dl.acm.org/doi/10.1145/3406325.3451014
RT T1 <cTitle>Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing</cTitle>: T1 <Title>When is approximate counting for conjunctive queries tractable?</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3451014&Exemplar=1&LAN=DE A1 Arenas, Marcelo A1 Croquevielle, Luis Alberto A1 Jayaram, Rajesh A1 Riveros, Cristian PB ACM YR 2021 K1 Conjunctive queries K1 approximate counting K1 fully polynomial-time approximation scheme (FPRAS) K1 tree automata K1 Theory of computation K1 Design and analysis of algorithms K1 Information systems K1 Data management systems K1 Query languages K1 Relational database query languages K1 Formal languages and automata theory K1 Tree languages SP 1015 OP 1027 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3406325.3451014 DO https://dl.acm.org/doi/10.1145/3406325.3451014 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
