2446 search results - page 155 / 490 » Choiceless Polynomial Time |
130
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
115
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
122
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
134
click to vote
ISCC
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
124
Voted
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...