Cited By
View all- Reif JFischer MDemillo RLynch NBurkhard WAho A(1979)Universal games of incomplete informationProceedings of the eleventh annual ACM symposium on Theory of computing10.1145/800135.804422(288-308)Online publication date: 30-Apr-1979
GO is pspace hard
Pages 48 - 54
Abstract
No abstract available.
Recommendations
GO-Mapper: functional analysis of gene expression data using the expression level as a score to evaluate Gene Ontology terms
Motivation: Retrieval of information on biological processes from large-scale expression data is still a time-consuming task. An automated analysis utilizing all expression information would greatly increase our understanding of the samples under ...
Fixed-Parameter Hierarchies inside PSPACE
LICS '06: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer ScienceTreewidth measures the "tree-likeness" of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this work, we study the impact of treewidth bounds on QBF, a canonical PSPACE-complete ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
October 1978
289 pages
Publisher
IEEE Computer Society
United States
Publication History
Published: 16 October 1978
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Jan 2025
Other Metrics
Citations
Cited By
View all- Reif JFischer MDemillo RLynch NBurkhard WAho A(1979)Universal games of incomplete informationProceedings of the eleventh annual ACM symposium on Theory of computing10.1145/800135.804422(288-308)Online publication date: 30-Apr-1979