Uwe Schöning
Uwe Schöning
Professor of Computer Science, Ulm University
確認したメール アドレス: uni-ulm.de - ホームページ
タイトル
引用先
引用先
The graph isomorphism problem: its structural complexity
J Kobler, U Schöning, J Torán
Springer Science & Business Media, 2012
6502012
Theoretische Informatik-kurz gefasst
U Schöning
Spektrum Akademischer Verlag 36 (46), 118, 2008
545*2008
A probabilistic algorithm for k-SAT and constraint satisfaction problems
U Schöning
Foundations of Computer Science, 1999. 40th Annual Symposium on, 410-414, 1999
5091999
Logik für Informatiker. Spektrum
U Schöning
Akademischer Verlag, 2000
350*2000
Graph isomorphism is in the low hierarchy
U Schöning
Sympos. on Theoretical Aspects of Comp. Sci. (STACS), 114-124, 1987
3141987
A deterministic (2− 2/(k+ 1)) n algorithm for k-SAT based on local search
E Dantsin, A Goerdt, EA Hirsch, R Kannan, J Kleinberg, C Papadimitriou, ...
Theoretical Computer Science 289 (1), 69-83, 2002
2442002
Complexity and structure
U Schöning
Lecture Notes in Computer Science 211, 1985
2191985
A low and a high hierarchy within NP
U Schöning
Journal of Computer and System Sciences 27 (1), 14-28, 1983
2011983
The difference and truth-table hierarchies for NP
J Köbler, U Schöning, KW Wagner
RAIRO Informatique théorique et applications 21 (4), 419-435, 1987
1721987
Logic for computer scientists
U Schöning
Springer Science & Business Media, 2008
1692008
Probabilistic complexity classes and lowness
U Schöning
Structure in Complexity Theory Conference, 2-8, 1987
1531987
Bi-immune sets for complexity classes
JL Balcázar, U Schöning
Mathematical Systems Theory 18 (1), 1-10, 1985
1361985
A probabilistic algorithm for k-SAT based on limited local search and restart
U Schöning
ALGORITHMICA-NEW YORK- 32 (4), 615-623, 2002
1352002
Algorithmik
U Schöning
Spektrum, Akad. Verlag, 2001
1242001
The polynomial-time hierarchy and sparse oracles
JL Balcázar, RV Book, U Schöning
Journal of the ACM (JACM) 33 (3), 603-617, 1986
1201986
On circuit-size complexity and the low hierarchy in NP
K Ko, U Schöning
1161985
A Probabilistic 3—SAT Algorithm Further Improved
T Hofmeister, U Schöning, R Schuler, O Watanabe
Annual Symposium on Theoretical Aspects of Computer Science, 192-202, 2002
1072002
Choosing probability distributions for stochastic local search and the role of make versus break
A Balint, U Schöning
International Conference on Theory and Applications of Satisfiability …, 2012
1022012
A uniform approach to obtain diagonal sets in complexity classes
U Schöning
Theoretical Computer Science 18 (1), 95-103, 1982
1021982
Turing machines with few accepting computations and low sets for PP
J Köbler, U Schöning, S Toda, J Toran
Journal of Computer and Systems Sciences (JCSS) 44, 272-286, 1992
1001992
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20