Sciweavers

270 search results - page 2 / 54
» Dynamic Complexity Theory Revisited
Sort
View
MST
2010
117views more  MST 2010»
13 years 2 days ago
The 1-Versus-2 Queries Problem Revisited
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
Rahul Tripathi
JITECH
2010
116views more  JITECH 2010»
13 years 3 months ago
Design theory for dynamic complexity in information infrastructures: the case of building internet
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
Ole Hanseth, Kalle Lyytinen
SMC
2007
IEEE
122views Control Systems» more  SMC 2007»
13 years 11 months ago
Can complexity science support the engineering of critical network infrastructures?
— Considerable attention is now being devoted to the study of “complexity science” with the intent of discovering and applying universal laws of highly interconnected and evo...
David Alderson, John C. Doyle
ACMSE
2006
ACM
13 years 9 months ago
Revisiting a limit on efficient quantum computation
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
Tarsem S. Purewal Jr.
CAISE
2009
Springer
13 years 8 months ago
The Problem of Transitivity of Part-Whole Relations in Conceptual Modeling Revisited
Abstract. Parthood is a relation of fundamental importance in a number of disciplines including cognitive science, linguistics and conceptual modeling. However, one classical probl...
Giancarlo Guizzardi