We investigate the theory IAo + Q, and strengthen [Bu86. Theorem 8.6] to the following: if NP 7 co-NP. then 1-completeness for witness comparison foumulas is not provable in bounded arithmetic.

We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by a strategy. Using a translation into mean-payoff parity games, we prove that deciding (the permissiveness of) a most permissive winning strategy is in NP ∩ coNP. Along ...

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the objective is to optimize the long-run average gain per action, and energy games, where the system has to avoid running out of energy. We study average-energy gam...

1. This document is HS918, one of a series of the Horticultural Sciences Department, Florida Cooperative Extension Service, Institute of Food and Agricultural Sciences, University of Florida. Publication date: May 2003. Please visit the EDIS Web site at http://edis.ifas.ufl.edu. 2. Daniel J. Cantliffe, professor and chair, Horticultural Sciences Department; John J. Vansickle, professor, Food an...

We consider the complexity of stochastic games { simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP \ co-NP.

With the exponential growth of scholarly data during the past few years, effective methods for topic classification are greatly needed. Current approaches usually require large amounts of expensive labeled data in order to make accurate predictions. In this paper, we posit that, in addition to a research article’s textual content, its citation network also contains valuable information. We desc...