Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Lozano, Antoni"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tile-packing tomography is NP-hard
Marek Chrobak
,
Christoph Dürr
,
Flavio Guíñez
,
Antoni Lozano
,
Nguyen Kim Thang
Algorithmica
64
(2), 2012, pp. 267-278
Tile-packing tomography is
\mathbb{NP}
-hard
Marek Chrobak
,
Christoph Dürr
,
Flavio Guíñez
,
Antoni Lozano
,
Nguyen Kim Thang
Lecture Notes in Computer Science
6196
, 2010, pp. 254-263
On the complexity of counting the number of vertices moved by graph automorphisms
Antoni Lozano
,
Vijay Raghavan
Lecture Notes in Computer Science
1530
, 1998, pp. 295-306
Succinct circuit representations and leaf language classes are basically the same concept
Bernd Borchert
,
Antoni Lozano
Information Processing Letters
59
(4), 1996, pp. 211-215
On sparse hard sets for counting classes
Mitsunori Ogiwara
,
Antoni Lozano
Theoretical Computer Science
112
, 1993, pp. 255-275
On the nonuniform complexity of the graph isomorphism problem
Antoni Lozano
,
Jacobo Torán
Proceedings of the 7th Annual Conference on Structure in Complexity Theory, CSCT'92 (Boston University, Boston, Massachusetts, June 22-25, 1992)
, 1992, pp. 118-129
Self-reducible sets of small density
Antoni Lozano
,
Jacobo Torán
Math. Systems Theory
24
, 1991, pp. 83-100
On one-query self-reducible sets
Mitsunori Ogiwara
,
Antoni Lozano
Proceedings of the 6th Annual Conference on Structure in Complexity Theory, CSCT'91 (Chicago, Illinois, June 30-July 3, 1991)
, 1991, pp. 139-151
The complexity of graph problems for succintly represented graphs
Antonio Lozano
,
José L. Balcázar
Lecture Notes in Computer Science
411
, 1989, pp. 277-286
On the nonuniform complexity of the graph isomorphism problem
Antoni Lozano
,
Jacobo Torán
Complexity Theory: Current Research, 1988, pp. 245-271