Cerca
Ara es mostren els items 1-10 de 11
On the complexity of exchanging
(2015-03-24)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
We analyze the computational complexity of the problem of deciding
whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j given losing coalitions into a set of j winning ...
Recent developments in structural complexity
(1988)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
This survey presents some of the recent developments in the field of structural complexity. The survey does not intend to give an exhaustive look in each one of the areas of structural complexity which have been developed ...
Measuring satisfaction in societies with opinion leaders and mediators
(2016-05-14)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
An opinion leader-follower model (OLF) is a two-action collective decision-making model for societies, in which three kinds of actors are considered:
Adaptive logspace reducibility and parallel time
(1991-11)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
We discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still ...
Approximating convex quadratic programming is P-complete
(1995)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
In this paper we show that the problem of Approximating Convex Quadratic Programming is P-complete. We also consider two approximation problems related to it, Solution Approximation and Value Approximation and show both ...
A note on the query complexity of learning DFA
(1992)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
It is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries ...
On the proper intervalization of colored caterpillar trees
(2009-11-01)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
This paper studies the computational complexity of the Proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a ...
Average-case analysis of equality of binary trees under the BST probability model
(1991-03)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
In this paper a simple algorithm to test equality of binary trees currently used in symbolic computation, unification, etc. is investigated. Surprisingly enough, it takes 0(1) steps on average to decide if a given pair of ...
Connections among non uniform models for problems requiring high amount of resources
(1985-11)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
We characterize in terms of oracle Turing machines the classes defined by exponential lower bounds on some nonuniform complexity measures. After, we use the same methods to give a new characterization of classes defined ...
Examples of CF-bi-inmune and CF-levelable sets in LOGSPACE
(1984)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
We find sets in the class LOGSPACE (on-line) that do not have good respectively approximations by context-free languages. For that we introduce the languages CF-bi-inmune and CF-levelable. We prove the results by defining ...