1055 search results - page 16 / 211 » Enumerations in computable structure theory |
STACS
2005
Springer
14 years 2 months ago
2005
Springer
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
DAC
2010
ACM
14 years 26 days ago
2010
ACM
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
KRMED
2004
13 years 10 months ago
2004
The symbolic representation of the physical structure of living organisms needs an ontologically well-founded and logically sound approach so that formal reasoning can adequately ...
GRC
2008
IEEE
13 years 10 months ago
2008
IEEE
Granular computing is gradually changing from a label to a new field of study. The driving forces, the major schools of thought, and the future research directions on granular co...