Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
11 years 9 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
11 years 10 months ago
Deciding k-Colorability of P5-Free Graphs in Polynomial Time
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
Chính T. Hoàng, Marcin Kaminski, Vad...
JCT
2000
103views more  JCT 2000»
11 years 11 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
ORL
2006
91views more  ORL 2006»
11 years 11 months ago
Resource augmentation in two-dimensional packing with orthogonal rotations
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...
José R. Correa
JCT
2006
100views more  JCT 2006»
11 years 11 months ago
Approximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
Sang-il Oum, Paul D. Seymour
FSTTCS
2008
Springer
12 years 20 days ago
STCON in Directed Unique-Path Graphs
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy
CRYPTO
2010
Springer
110views Cryptology» more  CRYPTO 2010»
12 years 21 days ago
An Efficient and Parallel Gaussian Sampler for Lattices
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
Chris Peikert
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
12 years 28 days ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
12 years 29 days ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
ICMLA
2007
12 years 1 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira
books