Publication date
January 1985
DOI Publisher
Columbia University Libraries/Information ServicesAbstract
We survey some recent results in information-based complexity, We focus on the worst case setting and also indicate some average case result
We survey some recent results in information-based complexity, We focus on the worst case setting and also indicate some average case result
AbstractWe present an information-based complexity problem for which the computational complexity ca...
This is the first section in a proposed monograph on algorithmic complexity theory. Future section...
The present volume is a collection of survey papers in the fields of entropy, search and complexity....
AbstractWe survey some recent results in information-based complexity. We focus on the worst case se...
\Ve survey some recent results in inrormation-ba:sed complexity, We focus on the wors
We survey some recent results in information-based complexity, We focus on the worst case setting an...
AbstractInformation-based complexity studies problems where only partial and contaminated informatio...
. We present a brief introduction to information-based complexity. An example of zero finding is cho...
I will survey work on exact algorithms for SAT, analyzed by their worst-case complexity. I will ment...
We review possible measures of complexity which might in particular be applicable to situations wher...
AbstractA new setting for analyzing problems in information-based complexity is formulated and discu...
Complexity is a catchword of certain extremely popular and rapidly devel oping interdisciplinary ne...
Information theory is a branch of mathematics that attempts to quantify information. To quantify inf...
Computational complexity has two goals: finding the inherent cost of some problem, and finding optim...
The article defines the concept of information capacity as a criterion for estimating the complexity...
AbstractWe present an information-based complexity problem for which the computational complexity ca...
This is the first section in a proposed monograph on algorithmic complexity theory. Future section...
The present volume is a collection of survey papers in the fields of entropy, search and complexity....
AbstractWe survey some recent results in information-based complexity. We focus on the worst case se...
\Ve survey some recent results in inrormation-ba:sed complexity, We focus on the wors
We survey some recent results in information-based complexity, We focus on the worst case setting an...
AbstractInformation-based complexity studies problems where only partial and contaminated informatio...
. We present a brief introduction to information-based complexity. An example of zero finding is cho...
I will survey work on exact algorithms for SAT, analyzed by their worst-case complexity. I will ment...
We review possible measures of complexity which might in particular be applicable to situations wher...
AbstractA new setting for analyzing problems in information-based complexity is formulated and discu...
Complexity is a catchword of certain extremely popular and rapidly devel oping interdisciplinary ne...
Information theory is a branch of mathematics that attempts to quantify information. To quantify inf...
Computational complexity has two goals: finding the inherent cost of some problem, and finding optim...
The article defines the concept of information capacity as a criterion for estimating the complexity...
AbstractWe present an information-based complexity problem for which the computational complexity ca...
This is the first section in a proposed monograph on algorithmic complexity theory. Future section...
The present volume is a collection of survey papers in the fields of entropy, search and complexity....
Add to ORKG