论文列表及评分结果

A Serial Version of the Pohlig-Hellman Algorithm for Computing Discrete Logarithms.

电商所评分:7

点击查看评分详情!

Necessary conditions for liouvillian solutions of (third order) linear differential equations.

电商所评分:9

点击查看评分详情!

Automated deduction with associative-commutative operators.

电商所评分:2

点击查看评分详情!

Factoring ofxn-1 and orthogonalization over finite fields of characteristic 2.

电商所评分:3

点击查看评分详情!

On irreducible polynomials of small height over finite fields.

电商所评分:10

点击查看评分详情!

Two families of low-correlated binary sequences.

电商所评分:10

点击查看评分详情!

Low redundancy polynomial checks for numerical computation.

电商所评分:10

点击查看评分详情!

Semi-numerical solution to 6/6-Stewart-platform kinematics based on symmetry.

电商所评分:8

点击查看评分详情!

An Improved General Path Order.

电商所评分:9

点击查看评分详情!

Provably Good Pattern Generators for a Random Pattern Test.

电商所评分:10

点击查看评分详情!

Finding the Closed Partition of a Planar Graph.

电商所评分:3

点击查看评分详情!

An Improved Technique for Output-Sensitive Hidden Surface Removal.

电商所评分:5

点击查看评分详情!

Designing Secure Communication Protocols from Trust Specification.

电商所评分:6

点击查看评分详情!

Dynamic Half-Space Range Reporting and Its Applications.

电商所评分:5

点击查看评分详情!

Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings, and Cycles.

电商所评分:5

点击查看评分详情!

New Primal and Dual Matching Heuristics.

电商所评分:2

点击查看评分详情!

On Greedy Heuristics for Steiner Minimum Trees.

电商所评分:2

点击查看评分详情!

Point Set Pattern Matching in d-Dimensions.

电商所评分:6

点击查看评分详情!

Computing Cartan subalgebras of Lie algebras.

电商所评分:2

点击查看评分详情!

Sparse shifts for univariate polynomials.

电商所评分:3

点击查看评分详情!

A combinatorial result on Gröbner Fans with an application to universal Gröbner bases.

电商所评分:8

点击查看评分详情!

Finite linear recurring sequences and homogeneous ideals.

电商所评分:1

点击查看评分详情!

Extensions of irreducible representations.

电商所评分:1

点击查看评分详情!

Relating graph and term rewriting via Böhm models.

电商所评分:3

点击查看评分详情!

Generation of Polynomial-Time Algorithms for Some Optimization Problems on Tree-Decomposable Graphs.

电商所评分:8

点击查看评分详情!

Isomorphic Tree Spanner Problems.

电商所评分:2

点击查看评分详情!

Lower Bounds for Set Intersection Queries.

电商所评分:4

点击查看评分详情!

A Time-Optimal Parallel Algorithm for Three-Dimensional Convex Hulls.

电商所评分:5

点击查看评分详情!

Finding a Closest Visible Vertex Pair Between Two Polygons.

电商所评分:3

点击查看评分详情!

A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues.

电商所评分:8

点击查看评分详情!