787 search results - page 121 / 158 » Polynomial Constants are Decidable |
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Feedback control laws are predominantly implemented on digital platforms as periodic tasks. Although periodicity simplifies the analysis and design of the implementati...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
STOC
1999
ACM
14 years 2 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
ICALP
1998
Springer
14 years 1 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
ICCAD
1994
IEEE
14 years 1 months ago
1994
IEEE
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...