#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1947

2018

- This year (3)
- Last 5 years (4)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Bernd Borchert, Antoni Lozano
- Electronic Colloquium on Computational Complexity
- 1996

This note connects two topics of complexity theory: The topic of succinct circuit representations initiated by Galperin and Wigderson (19831, and the topic of leaf language classes initiated by Bovetâ€¦ (More)

- Mitsunori Ogihara, Antoni Lozano
- Structure in Complexity Theory Conference
- 1991

We study one word-decreasing self-reducible sets, which are introduced by Lozano and Tor\â€™an [21]. These are usual self-reducible sets with the peculiarity that the self-reducibility machine makes atâ€¦ (More)

- Antoni Lozano, Jacobo TorÃ¡n
- Mathematical systems theory
- 1991

We study the complexity of sets that are at the same time self-reducible and sparse orm-reducible to sparse sets. We show that sets of this kind are low for the complexity classes Î” 2 p , Î˜ 2 p , NP,â€¦ (More)

The maximum common embedded subtree problem, which generalizes the minor containment problem on trees, is reduced for ordered trees to a variant of the longest common subsequence problem. While theâ€¦ (More)

- Antoni Lozano, JosÃ© L. BalcÃ¡zar
- WG
- 1989

- Vikraman Arvind, Richard Beigel, Antoni Lozano
- SIAM J. Comput.
- 2000

Motivated by the question of the relative complexities of the Graph Isomorphism and the Graph Automorphism problems, we deene and study the modular graph automorphism problems. These are the decisionâ€¦ (More)

Link-based data may be studied formally by means of unordered trees. On a dataset formed by such link-based data, a natural notion of support-based closure can be immediately defined. Abstractingâ€¦ (More)

- JosÃ© L. BalcÃ¡zar, Albert Bifet, Antoni Lozano
- Machine Learning
- 2009

Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There exists aâ€¦ (More)

- JosÃ© L. BalcÃ¡zar, Albert Bifet, Antoni Lozano
- EGC
- 2008

We propose a way of extracting high-confidence association rules from datasets consisting of unlabeled trees. The antecedents are obtained through a computation akin to a hypergraph transversal,â€¦ (More)

- Antoni Lozano
- Electr. J. Comb.
- 2011

We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S âœ“ V (T ) is a determining set for a tournament T if every nontrivial automorphism of Tâ€¦ (More)