Exploració per autor "Balcázar Navarro, José Luis"
Ara es mostren els items 61-79 de 79
-
Parallel complexity in the design and analysis of concurrent systems
(1990-10)
Report de recerca
Accés obertWe study the parallel complexity of three problems on concurrency: decision of firing sequences for Petri nets, trace equivalence for partially commutative monoids, and strong bisimilarity in finite transition systems. We ... -
Quantitative redundancy in partial implications
(Springer, 2015)
Text en actes de congrés
Accés obertWe survey the different properties of an intuitive notion of redundancy, as a function of the precise semantics given to the notion of partial implication. -
Refining logical characterizations of advice complexity classes
(1997-05)
Report de recerca
Accés obertNumerical relations in logics are known to characterize, via the finite models of their sentences, polynomial advice nonuniform complexity classes. These are known to coincide with reduction classes of tally sets. ... -
Relative entailment among probabilistic implications
(2019-02-06)
Article
Accés obertWe study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort ... -
Self-reducibility
(1988-11)
Report de recerca
Accés obertNew self-reducibility structures are proposed to deal with sets outside the class PSPACE and with sets in logarithmic space complexity classes. General properties derived from the definition are used to prove known results ... -
Self-reducibility structures and solutions of NP problems
(1988)
Report de recerca
Accés obertUsing polynomial time self-reducibility structures, we characterize certain "helping" notions, show how the characterization provides the main tool for the proof of known relationships between decisional and functional ... -
Sequential and parallel complexity of learning DFA
(Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1993)
Text en actes de congrés
Accés obertIt is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate the query complexity of learning deterministic finite automata, i.e., ... -
Simple PAC learning of simple decision lists
(1995-06)
Report de recerca
Accés obertWe prove that log n-decision lists - the class of decision lists such that all their terms have low Kolmogorov complexity - are learnable in the simple PAC learning model. The proof is based on a transformation from an ... -
Simplicity, relativizations, and nondeterminism
(1985-05)
Article
Accés obertRelativizations of complexity classes in which simple sets exist are considered. A recursive oracle is constructed relative to which a simple set exists for NP. Some other general theorems are proven, showing that the time ... -
Some structural complexity aspects of neural computation
(1992)
Report de recerca
Accés obertRecent work by Siegelmann and Sontag has demonstrated that polynomial time on linear saturated recurrent neural networks equas polynomial time on standard computational models: Turing machines if the weights of the net are ... -
Sparse sets, lowness, and highness
(1986-08)
Article
Accés obertWe develop the notions of “generalized lowness” for sets in PH (the union of the polynomial-time hierarchy) and of “generalized highness” for arbitrary sets. Also, we develop the notions of “extended lowness” and “extended ... -
Strong and robustly strong polynomial time reducibilities to sparse sets
(1988)
Report de recerca
Accés obertReducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform ... -
The Complexity of searching implicit graphs
(1995-01)
Report de recerca
Accés obertThe standard complexity classes of Complexity Theory do not allow for direct classification of most of the problems solved by heuristic search algorithms. The reason is that, in their standard definition, complexity classes ... -
The Consistency dimension and distribution-dependent learning from queries
(2000-05-01)
Report de recerca
Accés obertWe prove a new combinatorial characterization of polynomial learnability from equivalence queries, and state some of its consequences relating the learnability of a class with the learnability via equivalence and ... -
The Consistency dimension and distribution-dependent learning from queries: (extended abstract with appendices)
(1999-12)
Report de recerca
Accés obertWe prove a new combinatorial characterization of polynomial learnability from equivalence queries, and state some of its consequences relating the learnability of a class with the learnability via equivalence and membership ... -
The Structure of logarithmic advice complexity classes
(1997-06)
Report de recerca
Accés obertA nonuniform class called here Full-P/log, due to Ko, is studied. It corresponds to polynomial time with logarithmically long advice. Its importance lies in the structural properties it enjoys, more interesting than ... -
Two measures of objective novelty in association rule mining
(Springer, 2009)
Text en actes de congrés
Accés obertAssociation rule mining is well-known to depend heavily on a support threshold parameter, and on one or more thresholds for intensity of implication; among these measures, confidence is most often used and, sometimes, ... -
Unified characterization of symmetric dependencies with lattices
(2006)
Text en actes de congrés
Accés restringit per política de l'editorialSymmetric dependencies, or MultiValued Dependencies-like, are those dependencies that follow the deduction rules of MultiValued Dependencies (MVD’s). These are MVD-clauses, Degenerate MultiValued Dependencies (DMVD’s), and ... -
Uniform characterizations of non-uniform complexity measures
(1985)
Report de recerca
Accés obertThe class PSPACE/ply of sets decided within polynomial space by machines with polynomial advices is characterized in several way: we give an algebraic characterization, a parallel model characterization. Finally we define ...
