Sciweavers

36 search results - page 4 / 8
» tcs 1998
Sort
View
TCS
1998
14 years 11 months ago
A Hierarchy Based on Output Multiplicity
Ashish V. Naik, John D. Rogers, James S. Royer, Al...
54
Voted
TCS
1998
14 years 11 months ago
On the Relative Sizes of Learnable Sets
Lance Fortnow, Rusins Freivalds, William I. Gasarc...
TCS
2002
14 years 11 months ago
A characterization of c.e. random reals
A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...
Cristian Calude
TCS
1998
14 years 11 months ago
Parsing Schemata and Correctness of Parsing Algorithms
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...
Klaas Sikkel
TCS
1998
14 years 11 months ago
Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
Javier Esparza