29908 search results - page 270 / 5982 » On the Complexity of |
167
click to vote
IPL
2008
15 years 6 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
168
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin exte...
148
click to vote
JSYML
2008
15 years 6 months ago
2008
In a previous paper with M. Dzamonja, class forcings were given which fixed the complexity (a universality covering number) for certain types of structures of size together with ...
140
click to vote
EJC
2007
15 years 6 months ago
2007
: We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to Pn(u) = (p+q−1)n+1 for all n ≥ 0, where Pn(u) counts the number of distinct f...
175
click to vote
TSP
2008
15 years 6 months ago
2008
Analytical modeling of the performance of video coders is essential in a variety of applications, such as power-constrained processing, complexity-driven video streaming, etc., whe...