Limited nondeterminism-Reference-Cited by-同舟云学术

Limited nondeterminism

Published:1996-07 Issue:2 Volume:27 Page:20-29
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Goldsmith Judy¹,Levy Matthew A.¹,Mundhenk Martin²

Affiliation:

1. Univ. of Kentucky, Lexington

2. Univ. Trier, Trier, Germany

Abstract

Yes, the lucky 13th column is here, and it is a guest column written by J. Goldsmith, M. Levy, and M. Mundhenk on the topic of limited nondeterminism---classes and hierarchies derived when nondeterminism itself is viewed as a quantifiable resource (as it indeed is!).Coming up in the Complexity Theory Column in the very special 100th issue ofSIGACT News: A forum on the future of complexity theory. Many of the field's leading lights share their exciting insights on what lies ahead, so please be there in three!

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/235767.235769

Reference36 articles.

1. {4} R. Beigel and J. Goldsmith. Downward separation fails catastrophically for limited nondeterminism classes. Submitted ftp://ftp.cs.yale.edu/pub/beigel/bg-beta-draft.PS.gz. {4} R. Beigel and J. Goldsmith. Downward separation fails catastrophically for limited nondeterminism classes. Submitted ftp://ftp.cs.yale.edu/pub/beigel/bg-beta-draft.PS.gz.

2. {5} S.A. Bloch J.F. Buss and J. Goldsmith. Sharply bounded alternation within P. Submitted http://www.cs.engr.uky.edu/~goldsmit/main.ps. {5} S.A. Bloch J.F. Buss and J. Goldsmith. Sharply bounded alternation within P. Submitted http://www.cs.engr.uky.edu/~goldsmit/main.ps.

3. How hard are n 2 -hard problems?

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic;SIAM Journal on Computing;2018-01

2. Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method;ACM Transactions on Computation Theory;2016-12-26

3. A transversal hypergraph approach for the frequent itemset hiding problem;Knowledge and Information Systems;2015-07-17

4. Achieving new upper bounds for the hypergraph duality problem through logic;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14

5. A Multivariate Complexity Analysis of Lobbying in Multiple Referenda;Journal of Artificial Intelligence Research;2014-06-27