Almost-everywhere complexity hierarchies for nondeterministic time
- 作者Eric Allender; Richard Beigel; Ulrich Hertrampf; Steven Homer
- 卷第115卷
- 期第2期
- 印刷ISSN0304-3975
- 文件大小1276.06KB
- 发表时间1993
- DOI10.1016/0304-3975(93)90117-c
- 页码225-241
$R$-Sets and CategoryRana Barua · Transactions of the American Mathematical Society · 1984
Determining the Financial Performance of Non-Life Insurers: Static and Dynamic Panel Evidence from an Emerging EconomyBarua, Bipasha; Barua, Suborna; Rana, Rezwanul Hasan · The Journal of Developing Areas · 2018
On the Coleman indices of voting powerRana Barua; Satya R. Chakravarty; Sonali Roy · 2006
Complexity of Winning Strategies for Δ02GamesRana Barua · Proceedings of the American Mathematical Society · 1993
Borel hierarchies in infinite products of Polish spacesRana Barua; Ashok Maitra · 2007
A Note on $_2sc(mathbf{E}_1)$Rana Barua · Proceedings of the American Mathematical Society · 1988
The set of reversible 90150 cellular automata is regularPalash Sarkar; Rana Barua · 1998
Completeness of a combination of neighbourhood logic and temporal logicRana Barua · 2004