Games, complexity classes, and approximation algorithms.

Feigenbaum, Joan

Documenta Mathematica (1998)

  • page 429-439
  • ISSN: 1431-0643

How to cite

top

Feigenbaum, Joan. "Games, complexity classes, and approximation algorithms.." Documenta Mathematica (1998): 429-439. <http://eudml.org/doc/222677>.

@article{Feigenbaum1998,
author = {Feigenbaum, Joan},
journal = {Documenta Mathematica},
keywords = {perfect information; perfect recall},
language = {eng},
pages = {429-439},
publisher = {Universiät Bielefeld, Fakultät für Mathematik},
title = {Games, complexity classes, and approximation algorithms.},
url = {http://eudml.org/doc/222677},
year = {1998},
}

TY - JOUR
AU - Feigenbaum, Joan
TI - Games, complexity classes, and approximation algorithms.
JO - Documenta Mathematica
PY - 1998
PB - Universiät Bielefeld, Fakultät für Mathematik
SP - 429
EP - 439
LA - eng
KW - perfect information; perfect recall
UR - http://eudml.org/doc/222677
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.