|
Results
Found 9 publication records. Showing 9 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Klaus Meer |
On Ladner's Result for a Class of Real Machines with Restricted Use of Constants.  |
CiE  |
2009 |
DBLP DOI BibTeX RDF |
real number model, diagonal problems, Complexity |
| 1 | J. F. Traub, Arthur G. Werschulz |
Information-based Complexity and Information-based Optimization. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Information-based complexity, Information-based optimization, Real number model, High-dimensional integration, Mathematical finance, Linear programming, Nonlinear optimization, Curse of dimensionality |
| 1 | Stephen A. Vavasis |
Complexity Theory. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Information-based complexity, Real number model, Complexity, NP-complete, NP-hard, Polynomial time, Turing machine, Decision problem |
| 1 | Klaus Meer |
On the Approximation of Interval Functions. |
PARA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Meer |
On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory. |
Reliable Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Meer |
On the Complexity of Some Problems in Interval Arithmetic. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin E. Brimkov, Stefan S. Dantchev |
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. |
IFIP TCS |
2000 |
DBLP DOI BibTeX RDF |
Integer programming, Knapsack problem, Algebraic complexity, Complexity bounds |
| 1 | Henryk Wozniakowski |
Why Does Information-Based Complexity Use the Real Number Model? |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Erich Novak |
The Real Number Model in Numerical Analysis. |
J. Complexity |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #9 of 9 (100 per page; Change: )
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")