1916 search results - page 183 / 384 » Reasoning with class algebra |
119
click to vote
ASIACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
131
click to vote
IJCAI
1993
15 years 5 months ago
1993
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...
132
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
165
click to vote
CALCO
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
140
click to vote
ECCC
2008
15 years 4 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...