Publication date
January 2003
DOI Publisher
Springer Science and Business Media LLCAbstract
Brüggemann W, Fischer K, Jahnke H. Problems, Models and Complexity. Part I: Theory. Journal of Mathematical Modelling and Algorithms 2. 2003;2(2):121-151
Brüggemann W, Fischer K, Jahnke H. Problems, Models and Complexity. Part I: Theory. Journal of Mathematical Modelling and Algorithms 2. 2003;2(2):121-151
Computational complexity / by K. Wagner and G. Wechsung. - Dordrecht u. a. : Reidel, 1986. - 551 S. ...
Introduction Computational complexity is the study of the di#culty of solving computational problem...
I will discuss the basic notions related to the complexity theory. The classes of P and NP problems ...
Brüggemann W, Fischer K, Jahnke H. Problems, Models and Complexity. Part II: Application to the DLSP...
Gottinger HW. Complexity, bounded rationality and problem solving. Working Papers. Institute of Math...
1 Introduction Computational complexity theory studies the quantitative laws which govern computing....
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames...
International Journal of Combinatorial Optimization Problems and Informatics, vol. 2, núm. 2, mayo
What does it mean to say that some computational problem is intrinsically more difficult than some o...
Written by two experts in the field, this book is ideal for advanced undergraduate students, graduat...
What does it mean to say that some computational problem is intrinsically more difficult than some o...
Two models of proofs of lower bounds on the complexity are introduced. They have very wide applicabi...
The demonstration of a limitation on the abilities of a computational model is a central theme in co...
Over two parts, this book examines the meaning of complexity in the context of systems both social a...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
Computational complexity / by K. Wagner and G. Wechsung. - Dordrecht u. a. : Reidel, 1986. - 551 S. ...
Introduction Computational complexity is the study of the di#culty of solving computational problem...
I will discuss the basic notions related to the complexity theory. The classes of P and NP problems ...
Brüggemann W, Fischer K, Jahnke H. Problems, Models and Complexity. Part II: Application to the DLSP...
Gottinger HW. Complexity, bounded rationality and problem solving. Working Papers. Institute of Math...
1 Introduction Computational complexity theory studies the quantitative laws which govern computing....
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames...
International Journal of Combinatorial Optimization Problems and Informatics, vol. 2, núm. 2, mayo
What does it mean to say that some computational problem is intrinsically more difficult than some o...
Written by two experts in the field, this book is ideal for advanced undergraduate students, graduat...
What does it mean to say that some computational problem is intrinsically more difficult than some o...
Two models of proofs of lower bounds on the complexity are introduced. They have very wide applicabi...
The demonstration of a limitation on the abilities of a computational model is a central theme in co...
Over two parts, this book examines the meaning of complexity in the context of systems both social a...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
Computational complexity / by K. Wagner and G. Wechsung. - Dordrecht u. a. : Reidel, 1986. - 551 S. ...
Introduction Computational complexity is the study of the di#culty of solving computational problem...
I will discuss the basic notions related to the complexity theory. The classes of P and NP problems ...
Add to ORKG