You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances
|
---|---|
Chapter number | 37 |
Book title |
Principles and Practice of Constraint Programming – CP 2000
|
Published by |
Springer, Berlin, Heidelberg, September 2000
|
DOI | 10.1007/3-540-45349-0_37 |
Book ISBNs |
978-3-54-041053-9, 978-3-54-045349-9
|
Authors |
Renato Bruni, Antonio Sassano, Bruni, Renato, Sassano, Antonio |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Australia | 1 | 33% |
Unknown | 2 | 67% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 33% |
Professor > Associate Professor | 1 | 33% |
Other | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 67% |
Business, Management and Accounting | 1 | 33% |