Sciweavers

1763 search results - page 265 / 353
» Visualize and Open Up
Sort
View
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
14 years 3 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
COCOON
2003
Springer
14 years 3 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
ELPUB
1998
ACM
14 years 2 months ago
The Library in the Card: Results from Decomate Project and Current Developments at UAB
The Library in the card is the slogan which would summarize the aims of the Univeritat Autonoma de Barcelona (UAB) Library Service in its involvement in several EC Libraries Progr...
Nuria Gallart
VLDB
1997
ACM
97views Database» more  VLDB 1997»
14 years 2 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
ICS
2010
Tsinghua U.
14 years 2 months ago
Weight Distribution and List-Decoding Size of Reed-Muller Codes
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
Tali Kaufman, Shachar Lovett, Ely Porat