117 search results - page 15 / 24 » On Superlinear Lower Bounds in Complexity Theory |
157
Voted
STOC
2007
ACM
16 years 23 days 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...
104
Voted
STACS
1994
Springer
15 years 4 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
106
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
77
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— This paper is concerned with modeling, analysis and optimization/control of occupancy evolution in a large building. The main concern is efficient evacuation of a building in ...
105
Voted
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...