725 search results - page 6 / 145 » Bounding Degrees on RPL |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
JCSS
1998
14 years 9 months ago
1998
This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction princip...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
ECCC
2006
14 years 9 months ago
2006
We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...
106
click to vote
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...