3415 search results - page 475 / 683 » Lower bounds on kernelization |
143
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
187
click to vote
JCSS
2000
15 years 6 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
149
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
148
click to vote
MP
2007
15 years 6 months ago
2007
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
166
click to vote
NECO
2007
15 years 6 months ago
2007
An ensemble of stochastic non-leaky integrate-and-fire neurons with global, delayed and excitatory coupling and a small refractory period is analyzed. Simulations with adiabatic ...