2446 search results - page 18 / 490 » Choiceless Polynomial Time |
101
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
134
click to vote
ACL
2009
15 years 1 months ago
2009
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
135
click to vote
ALT
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
103
Voted
INDOCRYPT
2003
Springer
15 years 9 months ago
2003
Springer
We consider a variant of the Complex Multiplication (CM) method for constructing elliptic curves (ECs) of prime order with additional security properties. Our variant uses Weber po...
144
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...