Sciweavers

4047 search results - page 10 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
LICS
2000
IEEE
15 years 1 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
67
Voted
IJCAI
2003
14 years 10 months ago
Definition and Complexity of Some Basic Metareasoning Problems
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to t...
Vincent Conitzer, Tuomas Sandholm
IPPS
2000
IEEE
15 years 1 months ago
Parallelizability of Some P-Complete Problems
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuza...
ACTA
2000
104views more  ACTA 2000»
14 years 9 months ago
Some results on the Collatz problem
The paper refers to the Collatz's conjecture. In the first part, we present some equivalent forms of this conjecture and a slight generalization of a former result from [1]. T...
Stefan Andrei, Manfred Kudlek, Radu Stefan Nicules...
JSYML
2010
95views more  JSYML 2010»
14 years 4 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