5 search results - page 1 / 1 » Minimum Propositional Proof Length is NP-Hard to Linearly Ap... |
MFCS
1998
Springer
13 years 9 months ago
1998
Springer
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
FSS
2008
13 years 3 months ago
2008
We propose new types of linguistic summaries of time-series data that extend those proposed in our previous papers. The proposed summaries of time series refer to the summaries of...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...