494 search results - page 10 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
TCS
2011
13 years 2 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
COCOA
2011
Springer
12 years 7 months ago
2011
Springer
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...