Eintrag weiter verarbeiten
Computational complexity of quantified Boolean formulas with fixed maximal deficiency
Gespeichert in:
| Zeitschriftentitel: | Theoretical Computer Science |
|---|---|
| Personen und Körperschaften: | , |
| In: | Theoretical Computer Science, 407, 2008, 1-3, S. 448-457 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Elsevier BV
|
| Schlagwörter: |
| author_facet |
Kleine Büning, Hans Zhao, Xishun Kleine Büning, Hans Zhao, Xishun |
|---|---|
| author |
Kleine Büning, Hans Zhao, Xishun |
| spellingShingle |
Kleine Büning, Hans Zhao, Xishun Theoretical Computer Science Computational complexity of quantified Boolean formulas with fixed maximal deficiency General Computer Science Theoretical Computer Science |
| author_sort |
kleine büning, hans |
| spelling |
Kleine Büning, Hans Zhao, Xishun 0304-3975 Elsevier BV General Computer Science Theoretical Computer Science http://dx.doi.org/10.1016/j.tcs.2008.07.022 Computational complexity of quantified Boolean formulas with fixed maximal deficiency Theoretical Computer Science |
| doi_str_mv |
10.1016/j.tcs.2008.07.022 |
| facet_avail |
Online Free |
| finc_class_facet |
Informatik |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNi9qLnRjcy4yMDA4LjA3LjAyMg |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNi9qLnRjcy4yMDA4LjA3LjAyMg |
| institution |
DE-L229 DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Pl11 DE-Rs1 DE-105 DE-14 DE-Ch1 |
| imprint |
Elsevier BV, 2008 |
| imprint_str_mv |
Elsevier BV, 2008 |
| issn |
0304-3975 |
| issn_str_mv |
0304-3975 |
| language |
English |
| mega_collection |
Elsevier BV (CrossRef) |
| match_str |
kleinebuning2008computationalcomplexityofquantifiedbooleanformulaswithfixedmaximaldeficiency |
| publishDateSort |
2008 |
| publisher |
Elsevier BV |
| recordtype |
ai |
| record_format |
ai |
| series |
Theoretical Computer Science |
| source_id |
49 |
| title |
Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_unstemmed |
Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_full |
Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_fullStr |
Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_full_unstemmed |
Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_short |
Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_sort |
computational complexity of quantified boolean formulas with fixed maximal deficiency |
| topic |
General Computer Science Theoretical Computer Science |
| url |
http://dx.doi.org/10.1016/j.tcs.2008.07.022 |
| publishDate |
2008 |
| physical |
448-457 |
| description |
|
| container_issue |
1-3 |
| container_start_page |
448 |
| container_title |
Theoretical Computer Science |
| container_volume |
407 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792333120979075085 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T14:07:43.901Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Computational+complexity+of+quantified+Boolean+formulas+with+fixed+maximal+deficiency&rft.date=2008-11-01&genre=article&issn=0304-3975&volume=407&issue=1-3&spage=448&epage=457&pages=448-457&jtitle=Theoretical+Computer+Science&atitle=Computational+complexity+of+quantified+Boolean+formulas+with+fixed+maximal+deficiency&aulast=Zhao&aufirst=Xishun&rft_id=info%3Adoi%2F10.1016%2Fj.tcs.2008.07.022&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792333120979075085 |
| author | Kleine Büning, Hans, Zhao, Xishun |
| author_facet | Kleine Büning, Hans, Zhao, Xishun, Kleine Büning, Hans, Zhao, Xishun |
| author_sort | kleine büning, hans |
| container_issue | 1-3 |
| container_start_page | 448 |
| container_title | Theoretical Computer Science |
| container_volume | 407 |
| description | |
| doi_str_mv | 10.1016/j.tcs.2008.07.022 |
| facet_avail | Online, Free |
| finc_class_facet | Informatik |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAxNi9qLnRjcy4yMDA4LjA3LjAyMg |
| imprint | Elsevier BV, 2008 |
| imprint_str_mv | Elsevier BV, 2008 |
| institution | DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Pl11, DE-Rs1, DE-105, DE-14, DE-Ch1 |
| issn | 0304-3975 |
| issn_str_mv | 0304-3975 |
| language | English |
| last_indexed | 2024-03-01T14:07:43.901Z |
| match_str | kleinebuning2008computationalcomplexityofquantifiedbooleanformulaswithfixedmaximaldeficiency |
| mega_collection | Elsevier BV (CrossRef) |
| physical | 448-457 |
| publishDate | 2008 |
| publishDateSort | 2008 |
| publisher | Elsevier BV |
| record_format | ai |
| recordtype | ai |
| series | Theoretical Computer Science |
| source_id | 49 |
| spelling | Kleine Büning, Hans Zhao, Xishun 0304-3975 Elsevier BV General Computer Science Theoretical Computer Science http://dx.doi.org/10.1016/j.tcs.2008.07.022 Computational complexity of quantified Boolean formulas with fixed maximal deficiency Theoretical Computer Science |
| spellingShingle | Kleine Büning, Hans, Zhao, Xishun, Theoretical Computer Science, Computational complexity of quantified Boolean formulas with fixed maximal deficiency, General Computer Science, Theoretical Computer Science |
| title | Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_full | Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_fullStr | Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_full_unstemmed | Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_short | Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| title_sort | computational complexity of quantified boolean formulas with fixed maximal deficiency |
| title_unstemmed | Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
| topic | General Computer Science, Theoretical Computer Science |
| url | http://dx.doi.org/10.1016/j.tcs.2008.07.022 |