books search
books
articles search
articles
Donate
Log In
Log In
to access more features
personal recommendations
Telegram Bot
download history
send to Email or Kindle
manage booklists
save to favorites
Personal
Book Requests
Explore
Journals
Contribution
Donate
Litera Library
Donate paper books
Add paper books
Open LITERA Point
Volume 29; Issue 1
Main
Computational Complexity
Volume 29; Issue 1
Computational Complexity
Volume 29; Issue 1
1
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
Ito, Hiro
,
Khoury, Areej
,
Newman, Ilan
Journal:
Computational Complexity
Year:
2020
File:
PDF, 479 KB
Your tags:
2020
2
Communication Complexity with Small Advantage
Watson, Thomas
Journal:
Computational Complexity
Year:
2020
File:
PDF, 570 KB
Your tags:
2020
3
Correction to: Communication complexity with small advantage
Watson, Thomas
Journal:
Computational Complexity
Year:
2020
File:
PDF, 102 KB
Your tags:
2020
4
Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation
Meir, Or
Journal:
Computational Complexity
Year:
2020
File:
PDF, 379 KB
Your tags:
2020
5
Two-closures of supersolvable permutation groups in polynomial time
Ponomarenko, Ilia
,
Vasilâev, Andrey
Journal:
Computational Complexity
Year:
2020
File:
PDF, 418 KB
Your tags:
2020
1
Follow
this link
or find "@BotFather" bot on Telegram
2
Send /newbot command
3
Specify a name for your chatbot
4
Choose a username for the bot
5
Copy an entire last message from BotFather and paste it here
×
×
