Sciweavers

1511 search results - page 4 / 303
» Randomness, lowness and degrees
Sort
View
STOC
2003
ACM
65views Algorithms» more  STOC 2003»
15 years 9 months ago
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi ...
JZUSC
2010
129views more  JZUSC 2010»
14 years 8 months ago
Representing conics by low degree rational DP curves
: A DP curve is a new kind of parametric curve defined by Delgado and Peña (2003); it has very good properties when used in both geometry and algebra, i.e., it is shape preserving...
Qian-qian Hu, Guo-jin Wang
67
Voted
BMCBI
2006
118views more  BMCBI 2006»
14 years 9 months ago
Low degree metabolites explain essential reactions and enhance modularity in biological networks
Background: Recently there has been a lot of interest in identifying modules at the level of genetic and metabolic networks of organisms, as well as in identifying single genes an...
Areejit Samal, Shalini Singh, Varun Giri, Sandeep ...
75
Voted
DM
2008
94views more  DM 2008»
14 years 9 months ago
On low degree k-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
Karola Mészáros
59
Voted
JOC
2006
80views more  JOC 2006»
14 years 9 months ago
Elliptic Curves with Low Embedding Degree
Motivated by the needs of the pairing based cryptography, Miyaji, Nakabayashi and Takano have suggested a construction of so-called MNT elliptic curves with low embedding degree. ...
Florian Luca, Igor Shparlinski