13603 search results - page 303 / 2721 » On the Computational Complexity of Cut-Reduction |
167
Voted
ASIACRYPT
1991
Springer
15 years 10 months ago
1991
Springer
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
154
click to vote
CIE
2008
Springer
15 years 7 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
140
click to vote
ACL
2010
15 years 4 months ago
2010
We report on an experiment to track complex decision points in linguistic metadata annotation where the decision behavior of annotators is observed with an eyetracking device. As ...
156
click to vote
ITNG
2007
IEEE
16 years 1 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
149
Voted
APPML
2007
15 years 7 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...