182 search results - page 25 / 37 » The Proof Complexity of Polynomial Identities |
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
ALT
1995
Springer
14 years 1 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
ICDE
2009
IEEE
15 years 9 months ago
2009
IEEE
Context is any information used to characterize the situation of an entity. Examples of contexts includetime, location, identity, and activity of a user. This paper proposes a gene...
POPL
2008
ACM
14 years 10 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
CRYPTO
2005
Springer
14 years 3 months ago
2005
Springer
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...