Title
Polynomial Levelability and Maximal Complexity Cores
Year
DOI
Venue
1985
10.1007/BFb0015769
ICALP
Field
DocType
Volume
Discrete mathematics,Combinatorics,Polynomial,Recursive set,Computer science,Almost everywhere,PSPACE,If and only if,Time complexity,Non-deterministic Turing machine,Graph isomorphism problem
Conference
194
ISSN
ISBN
Citations 
0302-9743
3-540-15650-X
0
PageRank 
References 
Authors
0.34
12
3
Name
Order
Citations
PageRank
Pekka Orponen166076.80
David A. Russo2726.24
Uwe Schöning3998105.69