Automata, Languages and Programming
Springer Berlin Heidelberg
Chapter title |
On the Complexity of Resolution with Bounded Conjunctions
|
---|---|
Chapter number | 20 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2002
|
DOI | 10.1007/3-540-45465-9_20 |
Book ISBNs |
978-3-54-043864-9, 978-3-54-045465-6
|
Authors |
Juan Luis Esteban, Nicola Galesi, Jochen Messner |
Country | Count | As % |
---|---|---|
Austria | 1 | 7% |
Unknown | 14 | 93% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 5 | 33% |
Researcher | 3 | 20% |
Professor > Associate Professor | 2 | 13% |
Student > Master | 2 | 13% |
Lecturer | 1 | 7% |
Other | 0 | 0% |
Unknown | 2 | 13% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 12 | 80% |
Physics and Astronomy | 1 | 7% |
Unknown | 2 | 13% |