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
Counting Problems over Incomplete Databases:
, In:
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
,
Arenas, Marcelo
;
Barceló, Pablo
;
Monet, Mikaël
- p. 165-177 , 2020
Link:
https://dl.acm.org/doi/10.1145/3375395.3387656
RT T1
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
: T1
Counting Problems over Incomplete Databases
UL https://suche.suub.uni-bremen.de/peid=acm-3387656&Exemplar=1&LAN=DE A1 Arenas, Marcelo A1 Barceló, Pablo A1 Monet, Mikaël PB ACM YR 2020 K1 closed-world assumption K1 counting complexity K1 fpras K1 incomplete databases K1 Theory of computation K1 Computational complexity and cryptography K1 Complexity theory and logic K1 Theory and algorithms for application domains K1 Database theory K1 Incomplete, inconsistent, and uncertain databases K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Approximation algorithms SP 165 OP 177 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3375395.3387656 DO https://dl.acm.org/doi/10.1145/3375395.3387656 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)