default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 915
Volume 915, May 2022
- Konrad Zdanowski
:
On efficiency of notations for natural numbers. 1-10 - Robert Janczewski, Pawel Obszarski, Krzysztof Turowski:
Weighted 2-sections and hypergraph reconstruction. 11-25 - Alvaro Velasquez, K. Subramani, Piotr Wojciechowski:
On the complexity of and solutions to the minimum stopping and trapping set problems. 26-44 - Liqiong Xu, Shanshan Yin, Liyang Zhai:
Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model. 45-54 - Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos:
Completeness, approximability and exponential time results for counting problems with easy decision version. 55-73 - Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Resolute control: Forbidding candidates from winning an election is hard. 74-89 - Shaojun Yang, Xinyi Huang:
Universal product learning with errors: A new variant of LWE for lattice-based cryptography. 90-100
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-11 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
