1772 search results - page 109 / 355 » Classifying Problems into Complexity Classes |
161
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
152
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
152
click to vote
FSTTCS
2005
Springer
15 years 12 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
150
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
178
click to vote
CATA
2004
15 years 7 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...