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
On the complexity of #CSP:
, In:
Proceedings of the forty-second ACM symposium on Theory of computing
,
Dyer, Martin E.
;
Richerby, David M.
- p. 725-734 , 2010
Link:
https://dl.acm.org/doi/10.1145/1806689.1806789
RT T1 <cTitle>Proceedings of the forty-second ACM symposium on Theory of computing</cTitle>: T1 <Title>On the complexity of #CSP</Title> UL https://suche.suub.uni-bremen.de/peid=acm-1806789&Exemplar=1&LAN=DE A1 Dyer, Martin E. A1 Richerby, David M. PB ACM YR 2010 K1 complexity dichotomy K1 constraint satisfaction problem K1 counting problems K1 Theory of computation K1 Design and analysis of algorithms SP 725 OP 734 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/1806689.1806789 DO https://dl.acm.org/doi/10.1145/1806689.1806789 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
