Sciweavers

153 search results - page 1 / 31
» Some Decision Problems of Enormous Complexity
Sort
View
LICS
1999
IEEE
13 years 8 months ago
Some Decision Problems of Enormous Complexity
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
Harvey Friedman
JSYML
2010
95views more  JSYML 2010»
12 years 11 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
IWPEC
2009
Springer
13 years 11 months ago
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
Panos Giannopoulos, Christian Knauer, Günter ...
IJAR
2006
98views more  IJAR 2006»
13 years 4 months ago
A forward-backward Monte Carlo method for solving influence diagrams
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
Andrés Cano, Manuel Gómez, Seraf&iac...
MFCS
2004
Springer
13 years 10 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick