876 search results - page 31 / 176 » New Results for the Martin Polynomial |
STACS
1997
Springer
15 years 4 months ago
1997
Springer
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
100
click to vote
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
104
click to vote
DSN
2002
IEEE
15 years 4 months ago
2002
IEEE
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
120
click to vote
ISCAS
2007
IEEE
15 years 6 months ago
2007
IEEE
— The paper presents a new approach to the Volterra analysis of analog circuits. This kind of analysis is widely used for the calculation of distortion and intermodulation produc...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...