JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Schlotterbeck, Fabian | de_DE |
| dc.contributor.author | Bott, Oliver | de_DE |
| dc.date.accessioned | 2023-11-10T07:48:44Z | |
| dc.date.available | 2023-11-10T07:48:44Z | |
| dc.date.issued | 2013 | de_DE |
| dc.identifier.uri | http://hdl.handle.net/10900/147433 | |
| dc.language.iso | en | |
| dc.relation.uri | https://doi.org/10.1007/s10849-013-9181-9 | de_DE |
| dc.title | Easy solutions for a hard problem? : the computational complexity of reciprocals with quantificational | de_DE |
| dc.type | Article | de_DE |
| utue.personen.pnd | Schlotterbeck, Fabian/404263976 | de_DE |
| utue.publikation.seiten | 363-390 | de_DE |
| utue.personen.roh | Schlotterbeck, Fabian | de_DE |
| utue.personen.roh | Bott, Oliver | de_DE |
| dcterms.isPartOf.ZSTitelID | Journal of logic, language and information - Dordrecht [u.a.] : Springer Science + Business Media B.V. | de_DE |
| dcterms.isPartOf.ZS-Issue | 4 | de_DE |
| dcterms.isPartOf.ZS-Volume | 22 | de_DE |
| utue.titel.verfasserangabe | Fabian Schlotterbeck & Oliver Bott | de_DE |
| utue.publikation.abrufzeichen | of08 | de_DE |
| utue.publikation.swbdatum | 2310 | de_DE |
| utue.artikel.ppn | 1868859320 | de_DE |
Dateien zu dieser Ressource
| Dateien | Größe | Format | Anzeige |
|---|---|---|---|
|
Zu diesem Dokument gibt es keine Dateien. |
|||