1331 search results - page 177 / 267 » Complexity bounds for zero-test algorithms |
109
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
100
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
This paper addresses geometric problems that concern manufacturing an object using a cast with a core. In casting, molten material is poured into the cavity of the cast and allowe...
138
click to vote
COCO
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
128
click to vote
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
117
Voted
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...