5055 search results - page 14 / 1011 » Relative Timing |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
EMSOFT
2008
Springer
13 years 10 months ago
2008
Springer
Relations between models are important for effective automatic validation, for comparing implementations with specifications, and for increased understanding of embedded systems d...
DKE
2006
13 years 8 months ago
2006
Recursive queries are quite important in the context of XML databases. In addition, several recent papers have investigated a relational approach to store XML data and there is gr...
CCCG
2007
13 years 10 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give: