Buchumschlag

Separating NP-completeness notions under strong hypotheses

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ambos-Spies, Klaus (VerfasserIn) , Bentzien, Levke (VerfasserIn)
Dokumenttyp: Kapitel/Artikel Konferenzschrift
Sprache:Englisch
Veröffentlicht: 1997
In: Proceedings
Year: 1997, Pages: 121-127
Online-Zugang: Volltext
Verfasserangaben:K. Ambos-Spies, L. Bentzien

MARC

LEADER 00000caa a2200000 c 4500
001 1842943537
003 DE-627
005 20230710175457.0
007 tu
008 230417s1997 xx ||||| 00| ||eng c
035 |a (DE-627)1842943537 
035 |a (DE-599)KXP1842943537 
035 |a (OCoLC)1389826004 
040 |a DE-627  |b ger  |c DE-627  |e rda 
041 |a eng 
084 |a 27  |2 sdnb 
100 1 |a Ambos-Spies, Klaus  |d 1951-  |e VerfasserIn  |0 (DE-588)141551607  |0 (DE-627)629951861  |0 (DE-576)16006810X  |4 aut 
245 1 0 |a Separating NP-completeness notions under strong hypotheses  |c K. Ambos-Spies, L. Bentzien 
264 1 |c 1997 
300 |a 7 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
700 1 |a Bentzien, Levke  |e VerfasserIn  |0 (DE-588)1125912898  |0 (DE-627)880487887  |0 (DE-576)483627240  |4 aut 
773 0 8 |i Enthalten in  |a Conference on Computational Complexity (12 : 1997 : Ulm)  |t Proceedings  |d Los Alamitos, Calif. [u.a.] : IEEE Computer Soc. Press, 1997  |g (1997), Seite 121-127  |h X, 315 S.  |w (DE-627)1616061499  |w (DE-576)060332794  |z 0818679077  |z 0780342674  |z 0818679093  |7 nnam 
773 1 8 |g year:1997  |g pages:121-127  |g extent:7  |a Separating NP-completeness notions under strong hypotheses 
951 |a AR 
992 |a 20230417 
993 |a ConferencePaper 
994 |a 1997 
998 |g 1125912898  |a Bentzien, Levke  |m 1125912898:Bentzien, Levke  |d 110000  |d 110100  |d 110000  |d 110400  |e 110000PB1125912898  |e 110100PB1125912898  |e 110000PB1125912898  |e 110400PB1125912898  |k 0/110000/  |k 1/110000/110100/  |k 0/110000/  |k 1/110000/110400/  |p 2  |y j 
998 |g 141551607  |a Ambos-Spies, Klaus  |m 141551607:Ambos-Spies, Klaus  |d 110000  |d 110300  |e 110000PA141551607  |e 110300PA141551607  |k 0/110000/  |k 1/110000/110300/  |p 1  |x j 
999 |a KXP-PPN1842943537  |e 4309463150 
BIB |a Y 
JSO |a {"title":[{"title":"Separating NP-completeness notions under strong hypotheses","title_sort":"Separating NP-completeness notions under strong hypotheses"}],"origin":[{"dateIssuedKey":"1997","dateIssuedDisp":"1997"}],"id":{"eki":["1842943537"]},"person":[{"roleDisplay":"VerfasserIn","display":"Ambos-Spies, Klaus","role":"aut","family":"Ambos-Spies","given":"Klaus"},{"family":"Bentzien","given":"Levke","roleDisplay":"VerfasserIn","display":"Bentzien, Levke","role":"aut"}],"name":{"displayForm":["K. Ambos-Spies, L. Bentzien"]},"type":{"bibl":"chapter"},"physDesc":[{"extent":"7 S."}],"recId":"1842943537","relHost":[{"recId":"1616061499","corporate":[{"display":"Conference on Computational Complexity (12, 1997, Ulm)","role":"aut"},{"display":"IEEE Computer Society","role":"oth"},{"display":"Association for Computing Machinery","role":"oth"},{"role":"oth","display":"European Association for Theoretical Computer Science"}],"language":["eng"],"type":{"bibl":"book"},"disp":"Conference on Computational Complexity (12 : 1997 : Ulm)Proceedings","note":["IEEE catalon number 97CB36072"],"part":{"text":"(1997), Seite 121-127","extent":"7","year":"1997","pages":"121-127"},"title":[{"title_sort":"Proceedings / Twelfth Annual IEEE Conference on Computational Complexity; (formerly: Structure in Complexity Theory Conference)","subtitle":"June 24 - 27, 1997, Ulm, Germany","title":"Proceedings / Twelfth Annual IEEE Conference on Computational Complexity; (formerly: Structure in Complexity Theory Conference)"}],"physDesc":[{"noteIll":"graph. Darst.","extent":"X, 315 S."}],"id":{"isbn":["0818679077","0780342674","0818679093"],"eki":["1616061499"]},"origin":[{"publisherPlace":"Los Alamitos, Calif. [u.a.]","dateIssuedKey":"1997","publisher":"IEEE Computer Soc. Press","dateIssuedDisp":"1997"}]}],"language":["eng"]} 
SRT |a AMBOSSPIESSEPARATING1997 

Ähnliche Einträge