Classe complexité And NotSulamita Klein
List of bibliographic references
Number of relevant bibliographic references: 9.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000124 | G. Bonfante [France] ; J.-Y. Marion [France] ; J.-Y. Moyen [France] | Quasi-interpretations a way to control resources |
| 000349 | Guillaume Bonfante [France] | Some programming languages for LOGSPACE and PTIME |
| 000376 | Olivier Bournez [France] ; Felipe Cucker [Hong Kong] ; Paulin Jacobe De Naurois [France] ; Jean-Yves Marion [France] | Implicit complexity over an arbitrary structure : Quantifier alternations |
| 000462 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretations and small space bounds |
| 000591 | N. Danner [États-Unis] ; C. Pollett [États-Unis] | Minimization and NP multifunctions |
| 000A68 | P. Narendran [États-Unis] ; M. Rusinowitch [France] ; R. Verma [États-Unis] | RPO constraint solving is in NP |
| 000A97 | G. Bonfante [France] ; A. Cichon [France] ; J. Y. Marion [France] ; H. Touzet [France] | Complexity classes and rewrite systems with polynomial interpretation |
| 000B71 | H. Touzet [France] | A complex example of a simplifying rewrite system |
| 000C74 | M. Hermann [France] ; P. G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
| This area was generated with Dilib version V0.6.33. |  |