697 search results - page 51 / 140 » On the Theory of Average Case Complexity |
CORR
1999
Springer
13 years 7 months ago
1999
Springer
ABSTRACT. We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combi...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...
DAGSTUHL
2006
13 years 9 months ago
2006
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
FUN
2010
Springer
14 years 20 days ago
2010
Springer
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
INDOCRYPT
2001
Springer
14 years 9 days ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...