Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Study with us
Research
(current)
News
Events
About Us
Student Space
Partner with us
Home
Research
Publications
Succinctness as a Source of Complexity in Logical Formalisms
Succinctness as a Source of Complexity in Logical Formalisms
Georg Gottlob‚ Nicola Leone and Helmut Veith
Journal
Ann. Pure Appl. Logic
Number
1−3
Pages
231−260
Volume
97
Year
1999
Links
BibTeX
See Also
Georg Gottlob
Algorithms and Complexity Theory
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data, Knowledge and Action
Human Centred Computing
Programming Languages
Quantum
Security
Systems
Back to Top