Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
30
views
72
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,036
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
The Multivariate Algorithmic Revolution and Beyond
Backdoors to Satisfaction
other
Author(s):
Serge Gaspers
,
Stefan Szeider
Publication date
(Print):
2012
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
72
Record
: found
Abstract
: not found
Article
: not found
A machine program for theorem-proving
Martin Davis
,
George Logemann
,
Donald Loveland
(1962)
0
comments
Cited
305
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Parameterized Complexity
R. G. Downey
,
M. Fellows
(1999)
0
comments
Cited
255
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
The complexity of satisfiability problems
Thomas Schaefer
(1978)
0
comments
Cited
235
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 287-317
DOI:
10.1007/978-3-642-30891-8_15
SO-VID:
9384beb5-b06b-495f-a7a7-11e324189987
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 129
Kernelization – Preprocessing with a Guarantee
pp. 196
Fixed-Parameter Tractability of Treewidth and Pathwidth
pp. 287
Backdoors to Satisfaction
Similar content
1,036
Don't Trigger Me! A Triggerless Backdoor Attack Against Deep Neural Networks
Authors:
Ahmed Salem
,
Michael Backes
,
Yang Zhang
Strong Data Augmentation Sanitizes Poisoning and Backdoor Attacks Without an Accuracy Tradeoff
Authors:
Eitan Borgnia
,
Valeriia Cherepanova
,
Liam Fowl
…
Here's a Free Lunch: Sanitizing Backdoored Models with Model Merge
Authors:
Ansh Arora
,
Xuanli He
,
Maximilian Mozes
…
See all similar
Cited by
9
Backdoors to Acyclic SAT
Authors:
Serge Gaspers
,
Stefan Szeider
Parameterized Enumeration for Modification Problems
Authors:
Nadia Creignou
,
Raïda Ktari
,
Arne Meier
…
Hunting for Tractable Languages for Judgment Aggregation
Authors:
Ronald de Haan
See all cited by