scispace - formally typeset
Search or ask a question
JournalISSN: 0304-3975

Theoretical Computer Science 

Elsevier BV
About: Theoretical Computer Science is an academic journal published by Elsevier BV. The journal publishes majorly in the area(s): Time complexity & Upper and lower bounds. It has an ISSN identifier of 0304-3975. Over the lifetime, 12465 publications have been published receiving 368956 citations.

More filters
Journal ArticleDOI
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.

7,096 citations

Journal ArticleDOI
TL;DR: A protocol for coin-tossing by exchange of quantum messages is presented, which is secure against traditional kinds of cheating, even by an opponent with unlimited computing power, but ironically can be subverted by use of a still subtler quantum phenomenon, the Einstein-Podolsky-Rosen paradox.

5,126 citations

Journal ArticleDOI
TL;DR: It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems associated with nondeterministic polynomial time computations.

2,980 citations

Book ChapterDOI
David Park1
TL;DR: A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.

2,256 citations

Journal ArticleDOI
TL;DR: This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete.

2,200 citations

No. of papers from the Journal in previous years