Sciweavers

1695 search results - page 141 / 339
» Linear, Polynomial or Exponential
Sort
View
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
16 years 5 months ago
Lower bounds for k-DNF resolution on random 3-CNFs
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
Michael Alekhnovich
DCC
1999
IEEE
15 years 9 months ago
Performance of Quantizers on Noisy Channels Using Structured Families of Codes
Abstract--Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for ...
András Méhes, Kenneth Zeger
133
Voted
CSL
2009
Springer
15 years 8 months ago
Confluence of Pure Differential Nets with Promotion
We study the confluence of Ehrhard and Regnier's differential nets with exponential promotion, in a pure setting. Confluence fails with promotion and codereliction in absence ...
Paolo Tranquilli
WINE
2009
Springer
127views Economy» more  WINE 2009»
15 years 11 months ago
Nash Dynamics in Congestion Games with Similar Resources
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
146
Voted
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 10 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm