The extent to which linear problems have linear optimal algorithms

Edward W. Packel

Banach Center Publications (1988)

  • Volume: 21, Issue: 1, page 341-357
  • ISSN: 0137-6934

How to cite

top

Edward W. Packel. "The extent to which linear problems have linear optimal algorithms." Banach Center Publications 21.1 (1988): 341-357. <http://eudml.org/doc/267941>.

@article{EdwardW1988,
author = {Edward W. Packel},
journal = {Banach Center Publications},
keywords = {information-based complexity; theory of optimal algorithms},
language = {eng},
number = {1},
pages = {341-357},
title = {The extent to which linear problems have linear optimal algorithms},
url = {http://eudml.org/doc/267941},
volume = {21},
year = {1988},
}

TY - JOUR
AU - Edward W. Packel
TI - The extent to which linear problems have linear optimal algorithms
JO - Banach Center Publications
PY - 1988
VL - 21
IS - 1
SP - 341
EP - 357
LA - eng
KW - information-based complexity; theory of optimal algorithms
UR - http://eudml.org/doc/267941
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.