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: Journal=Theory of Computing Systems AND Volume=46
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generic complexity of Presburger arithmetic
Alexander N. Rybalov
Theory of Computing Systems
46
(1), 2010, pp. 2-8
On the complexity of matrix rank and rigidity
Meena Mahajan
,
Jayalal M.N. Sarma
Theory of Computing Systems
46
(1), 2010, pp. 9-26
Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
Artur Jeż
,
Alexander Okhotin
Theory of Computing Systems
46
(1), 2010, pp. 27-58
A fast algorithm for the path 2-packing problem
Maxim A. Babenko
Theory of Computing Systems
46
(1), 2010, pp. 59-79
Equivalence problems for circuits over sets of natural numbers
Christian Glaßer
,
Katrin Herr
,
Christian Reitwießner
,
Stephen Travers
,
Matthias Waldherr
Theory of Computing Systems
46
(1), 2010, pp. 80-103
Maximal intersection queries in randomized input models
Benjamin Hoffmann
,
Mikhail Lifshits
,
Yury Lifshits
,
Dirk Nowotka
Theory of Computing Systems
46
(1), 2010, pp. 104-119
Efficient algorithms for sparse cyclotomic integer zero testing
Qi Cheng
,
Sergey P. Tarasov
,
Mikhail N. Vyalyi
Theory of Computing Systems
46
(1), 2010, pp. 120-142
Does the polynomial hierarchy collapse if onto functions are invertible?
Harry Buhrman
,
Lance Fortnow
,
Michal Koucký
,
John D. Rogers
,
Nikolay Vershchagin
Theory of Computing Systems
46
(1), 2010, pp. 143-156
Disc covering problem with application to digital halftoning
Tetsuo Asano
,
Peter Brass
,
Shinji Sasahara
Theory of Computing Systems
46
(2), 2010, pp. 157-173
A new characterization of
NP, P
and
P
SPACE with accepting hybrid networks of evolutionary processors
Florin Manea
,
Maurice Margenstern
,
Victor Mitrana
,
Mario J. Pérez-Jiménez
Theory of Computing Systems
46
(2), 2010, pp. 174-192
The 1-versus-2 queries problem revisited
Rahul Tripathi
Theory of Computing Systems
46
(2), 2010, pp. 193-221
On the autoreducibility of functions
Piotr Faliszewski
,
Mitsunori Ogihara
Theory of Computing Systems
46
(2), 2010, pp. 222-245
Class constrained bin covering
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
Theory of Computing Systems
46
(2), 2010, pp. 246-260
Fixed-parameter enumerability of cluster editing and related problems
Peter Damaschke
Theory of Computing Systems
46
(2), 2010, pp. 261-283
Bijective linear time coding and decoding for
k
-trees
Saverio Caminiti
,
Emanuele G. Fusco
,
Rossella Petreschi
Theory of Computing Systems
46
(2), 2010, pp. 284-300
Entropy of operators or why matrix multiplication is hard for depth-two circuits
Stasys Jukna
Theory of Computing Systems
46
(2), 2010, pp. 301-310
W
-hierarchies defined by symmetric gates
Michael Fellows
,
Jörg Flum
,
Danny Hermelin
,
Moritz Müller
,
Frances Rosamond
Theory of Computing Systems
46
(2), 2010, pp. 311-339
Computing interpolating sequences
Valentin V. Andreev
,
Timothy H. McNicholl
Theory of Computing Systems
46
(2), 2010, pp. 340-350
On bounded rational trace languages
Christian Choffrut
,
Flavio D'Alessandro
,
Stefano Varricchio
Theory of Computing Systems
46
(2), 2010, pp. 351-369
Approximability of clausal constraints
Peter Jonsson
,
Gustav Nordh
Theory of Computing Systems
46
(2), 2010, pp. 370-395
On symmetric signatures in holographic algorithms
Jin-Yi Cai
,
Pinyan Lu
Theory of Computing Systems
46
(3), 2010, pp. 398-415
Small space representations for metric min-sum
k
-clustering and their applications
Artur Czumaj
,
Christian Sohler
Theory of Computing Systems
46
(3), 2010, pp. 416-442
Sturmian trees
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Isabelle Fagnot
Theory of Computing Systems
46
(3), 2010, pp. 443-478
A search algorithm for subshift attractors of cellular automata
Enrico Formenti
,
Petr Kůrka
,
Ondȓej Zahradník
Theory of Computing Systems
46
(3), 2010, pp. 479-498
Arithmetizing classes around NC
^1
and L
Nutan Limaye
,
Meena Mahajan
,
B.V. Raghavendra Rao
Theory of Computing Systems
46
(3), 2010, pp. 499-522
Seiten 1
2
>