Search Sciweavers | Sciweavers

9842 search results - page 23 / 1969

» The Complexity of the Matching-Cut Problem

102

click to vote

MFCS
1999
Springer

99views Theoretical Computer Science» more MFCS 1999»

The Complexity of the Extended GCD Problem

15 years 7 months ago

Download dimacs.rutgers.edu

George Havas, Jean-Pierre Seifert

claim paper

Read More »

110

click to vote

COLT
1998
Springer

84views Machine Learning» more COLT 1998»

Testing Problems with Sub-Learning Sample Complexity

15 years 7 months ago

Download www.eng.tau.ac.il

Michael J. Kearns, Dana Ron

claim paper

Read More »

click to vote

RANDOM
1997
Springer

88views Theoretical Computer Science» more RANDOM 1997»

Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model

15 years 7 months ago

Download www.mpi-inf.mpg.de

Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volke...

claim paper

Read More »

107

click to vote

CADE
1994
Springer

161views Logical Reasoning» more CADE 1994»

The Complexity of Counting Problems in Equational Matching

15 years 7 months ago

Download www.lix.polytechnique.fr

Miki Hermann, Phokion G. Kolaitis

claim paper

Read More »

129

Voted

WG
1994
Springer

131views Theoretical Computer Science» more WG 1994»

Complexity of Graph Covering Problems

15 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers