13306 search results - page 321 / 2662 » Theoretical Computer Science |
146
click to vote
MFCS
1989
Springer
15 years 10 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
131
click to vote
GI
2009
Springer
15 years 11 months ago
2009
Springer
: Today, mobile phones are becoming an essential device in our daily life, and carried comfortably and regularly by a huge percentage of population. In this note, we propose an app...
137
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
227
click to vote
WMP
2000
15 years 10 months ago
2000
This paper is an attempt to summarize the basic elements of the multiset theory. We begin by describing multisets and the operations between them, then we present hybrid sets and t...
166
Voted
TCS
1998
15 years 6 months ago
1998
Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...