2035 search results - page 404 / 407 » On the complexity of stratified logics |
JCSS
2000
15 years 6 days ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
126
click to vote
AC
1998
Springer
15 years 4 days ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
125
Voted
GEOINFORMATICA
1998
15 years 3 days ago
1998
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...
123
Voted
INFORMS
1998
15 years 2 days ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
105
click to vote
AES
2008
Springer
15 years 23 hour ago
2008
Springer
This paper presents research that led to the design and implementation of an extensible and scalable software framework for the dynamic 3D visualization of simulated construction ...