default search action
Theoretical Computer Science, Volume 295
Volume 295, Number 1-3, 24 February 2003
- Andris Ambainis, Arnolds Kikusts:
Exact results for accepting probabilities of quantum automata. 3-25 - Albert Atserias:
Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms. 27-39 - Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Reachability problems for sequential dynamical systems with threshold functions. 41-64 - Markus Bläser:
The complexity of bivariate power series arithmetic. 65-83 - Ahmed Bouajjani, Peter Habermehl, Richard Mayr:
Automatic verification of recursive procedures with one integer parameter. 85-106 - Sabin Cautis, Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang, Soroosh Yazdani:
Periodicity, morphisms, and matrices. 107-121 - Giovanni Di Crescenzo:
Sharing one secret vs. sharing many secrets. 123-140 - Pavol Duris, Ján Manuch:
On the computational complexity of infinite words. 141-151 - Hervé Fournier:
Quantifier rank for parity of embedded finite models. 153-169 - Viliam Geffert:
Space hierarchy theorem revised. 171-187 - Viliam Geffert, Carlo Mereghetti
, Giovanni Pighizzini
Converting two-way nondeterministic unary automata into simpler automata. 189-203 - Thanh Minh Hoang, Thomas Thierauf:
The complexity of the characteristic and the minimal polynomial. 205-222 - Jarkko Kari
Synchronizing finite automata on Eulerian digraphs. 223-232 - Andreas Klein, Martin Kutrib
Fast one-way cellular automata. 233-250 - Chiu-Yuen Koo, Tak Wah Lam
On-line scheduling with tight deadlines. 251-261 - Daniel Král
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. 263-278 - Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie:
News from the online traveling repairman. 279-294 - Nir Piterman
From bidirectionality to alternation. 295-321 - Pavel Pudlák:
On reducibility and symmetry of disjoint NP pairs. 323-339 - Luigi Santocanale
On the equational definition of the least prefixed point. 341-370 - Klaus Sutner:
The size of power automata. 371-386 - Martin Thimm:
On the approximability of the Steiner tree problem. 387-402
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-14 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: