Sciweavers

1169 search results - page 24 / 234
» Degrees of monotone complexity
Sort
View
LICS
2008
IEEE
15 years 6 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
COMPLEX
2009
Springer
15 years 6 months ago
On General Laws of Complex Networks
By introducing and analyzing a renormalization procedure, Song et al. [1] draw the conclusion that many complex networks exhibit self-repeating patterns on all length scales. First...
Wenjun Xiao, Limin Peng, Behrooz Parhami
JZUSC
2010
129views more  JZUSC 2010»
14 years 10 months ago
Representing conics by low degree rational DP curves
: A DP curve is a new kind of parametric curve defined by Delgado and Peña (2003); it has very good properties when used in both geometry and algebra, i.e., it is shape preserving...
Qian-qian Hu, Guo-jin Wang
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 1 days ago
Approximating minimum bounded degree spanning trees to within one of optimal
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...
Mohit Singh, Lap Chi Lau
ECCC
2007
124views more  ECCC 2007»
14 years 11 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler