Sciweavers

1695 search results - page 53 / 339
» Linear, Polynomial or Exponential
Sort
View
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 7 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
93
Voted
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 5 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
4OR
2010
137views more  4OR 2010»
15 years 28 days ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 27 days ago
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
82
Voted
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
15 years 5 months ago
Uniform stabilization of Markovian jump linear systems with logarithmic quantization - A convex approach
— In this paper, we investigate the almost sure uniform exponential stabilization problem of Markovian jump linear systems (MJLSs) with logarithmically quantized state feedbacks....
Chun Zhang, Geir E. Dullerud