163 search results - page 33 / 33 » Computationally Convincing Proofs of Knowledge |
147
click to vote
SLOGICA
2011
14 years 4 months ago
2011
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
JSC
2010
14 years 4 months ago
2010
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...
100
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...