Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 220
Volumes 220-221, November - December 2012
- Martin E. Dyer
, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The complexity of approximating bounded-degree Boolean #CSP. 1-14 - Joachim Bremer, Dominik D. Freydenberger:
Inclusion problems for patterns with a bounded number of variables. 15-43 - Manfred Droste, Ingmar Meinecke:
Weighted automata and weighted MSO logics for average and long-time behaviors. 44-59 - John Case, Timo Kötzing:
Learning secrets interactively. Dynamic modeling in inductive inference. 60-73
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-20 21:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
