13603 search results - page 20 / 2721 » On the Computational Complexity of Cut-Reduction |
AII
1989
14 years 15 days ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
CADE
2008
Springer
13 years 10 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
FCT
1991
Springer
13 years 12 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...