Sciweavers

307 search results - page 30 / 62
» On Equations over Sets of Integers
Sort
View
CC
2010
Springer
112views System Software» more  CC 2010»
13 years 2 months ago
Random Cnf's are Hard for the Polynomial Calculus
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
Eli Ben-Sasson, Russell Impagliazzo
ICCAD
2004
IEEE
139views Hardware» more  ICCAD 2004»
14 years 4 months ago
Fast simulation of VLSI interconnects
This paper introduces an efficient and accurate interconnect simulation technique. A new formulation for typical VLSI interconnect structures is proposed which, in addition to pr...
Jitesh Jain, Cheng-Kok Koh, Venkataramanan Balakri...
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 7 months ago
The algebraicity of the lambda-calculus
Abstract. We propose a new definition for abstract syntax (with binding constructions), and, accordingly, for initial semantics and algebraicity. Our definition is based on the n...
André Hirschowitz, Marco Maggesi
EOR
2007
272views more  EOR 2007»
13 years 7 months ago
A dynamic logistics coordination model for evacuation and support in disaster response activities
This paper describes an integrated location-distribution model for coordinating logistics support and evacuation operations in disaster response activities. Logistics planning in ...
Wei Yi, Linet Özdamar
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
14 years 1 months ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo