Sciweavers

137

click to vote

STOC
1991
ACM

163views Algorithms» more STOC 1991»

Clique Partitions, Graph Compression, and Speeding-Up Algorithms

15 years 8 months ago

Download www.combinatorics.net

Tomás Feder, Rajeev Motwani

claim paper

Read More »

128

click to vote

STOC
1991
ACM

105views Algorithms» more STOC 1991»

An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs

15 years 8 months ago

Download www.cs.duke.edu

act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...

Hristo Djidjev, John H. Reif

claim paper

Read More »

118

click to vote

STOC
1991
ACM

87views Algorithms» more STOC 1991»

Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis

15 years 8 months ago

Download www.cdc.informatik.tu-darmstadt.de

We describe a new deterministic algorithm for the problem of constructing k-th

Johannes Buchmann, Victor Shoup

claim paper

Read More »

118

click to vote

STOC
1991
ACM

109views Algorithms» more STOC 1991»

Checking Computations in Polylogarithmic Time

15 years 8 months ago

Download people.cs.uchicago.edu

László Babai, Lance Fortnow, Leonid ...

claim paper

Read More »

102

click to vote

STOC
1991
ACM

87views Algorithms» more STOC 1991»

Fast Monte Carlo Algorithms for Permutation Groups

15 years 8 months ago

Download ix.cs.uoregon.edu

László Babai, Gene Cooperman, Larry ...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers