ON RANDOM REDUCTIONS FROM SPARSE SETS TO TALLY SETS

被引：7

作者：

SCHONING, U

机构：

[1] Abteilung Theoretische Informatik, Universität Ulm

来源：

关键词：

COMPUTATIONAL COMPLEXITY; RANDOM REDUCTIONS; SPARSE SETS; TALLY SETS; COMPLETENESS;

D O I：

10.1016/0020-0190(93)90102-F

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：239 / 241

页数：3

共 50 条

[1] SPARSE SETS, TALLY SETS, AND POLYNOMIAL REDUCIBILITIES
BOOK, RV
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 1 - 13
[2] REDUCIBILITIES ON TALLY AND SPARSE SETS
TANG, S
BOOK, RV
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1991, 25 (03): : 293 - 302
[3] ON REDUCTIONS OF NP SETS TO SPARSE SETS
HOMER, S
LONGPRE, L
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 48 (02) : 324 - 336
[4] Learning Reductions to Sparse Sets
Buhrman, Harry
Fortnow, Lance
Hitchcock, John M.
Loff, Bruno
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 243 - 253
[5] Monotonous and randomized reductions to sparse sets
Arvind, V
Kobler, J
Mundhenk, M
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1996, 30 (02): : 155 - 179
[6] INFINITE SIDON SETS CONTAINED IN SPARSE RANDOM SETS OF INTEGERS
Kohayakawa, Yoshiharu
Lee, Sang June
Moreira, Carlos Gustavo
Rodl, Vojtech
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (01) : 410 - 449
[7] Combinatorial theorems in sparse random sets
Conlon, D.
Gowers, W. T.
ANNALS OF MATHEMATICS, 2016, 184 (02) : 367 - 454
[8] INDEPENDENT SETS IN RANDOM SPARSE GRAPHS
GAZMURI, PG
NETWORKS, 1984, 14 (03) : 367 - 377
[9] FREIMAN HOMOMORPHISMS ON SPARSE RANDOM SETS
Conlon, D.
Gowers, W. T.
QUARTERLY JOURNAL OF MATHEMATICS, 2017, 68 (01): : 275 - 300
[10] Independent Sets of Random Trees and Sparse Random Graphs
Heilman, Steven
JOURNAL OF GRAPH THEORY, 2025,