Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 65 matches
- 2024
- Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in schelling games: computational hardness and robustness. Auton. Agents Multi Agent Syst. 38(1): 9 (2024) - Paolo Santini, Marco Baldi, Franco Chiaraluce:
Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems. IEEE Trans. Inf. Theory 70(3): 2254-2270 (2024) - 2023
- Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini:
On the computational hardness of the code equivalence problem in cryptography. Adv. Math. Commun. 17(1): 23-55 (2023) - Zvika Brakerski, Ran Canetti, Luowen Qian:
On the Computational Hardness Needed for Quantum Cryptography. ITCS 2023: 24:1-24:21 - Ali Çivril:
Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation. CoRR abs/2305.05676 (2023) - Bruno Cavalar, Eli Goldin, Matthew Gray, Peter Hall, Yanyi Liu, Angelos Pelecanos:
On the Computational Hardness of Quantum One-Wayness. CoRR abs/2312.08363 (2023) - 2022
- Martin Bichler, Stefan Waldherr:
Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions. Oper. Res. 70(1): 241-264 (2022) - Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in Schelling Games: Computational Hardness and Robustness. AAMAS 2022: 761-769 - Tamir Bendory, Oscar Michelin, Amit Singer:
Sparse Multi-Reference Alignment: Sample Complexity and Computational Hardness. ICASSP 2022: 8977-8981 - Thomas Chen, Xi Chen, Binghui Peng, Mihalis Yannakakis:
Computational Hardness of the Hylland-Zeckhauser Scheme. SODA 2022: 2253-2268 - Zvika Brakerski, Ran Canetti, Luowen Qian:
On the computational hardness needed for quantum cryptography. CoRR abs/2209.04101 (2022) - David Gamarnik, Cristopher Moore, Lenka Zdeborová:
Disordered Systems Insights on Computational Hardness. CoRR abs/2210.08312 (2022) - Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini:
On the Computational Hardness of the Code Equivalence Problem in Cryptography. IACR Cryptol. ePrint Arch. 2022: 967 (2022) - Zvika Brakerski, Ran Canetti, Luowen Qian:
On the computational hardness needed for quantum cryptography. IACR Cryptol. ePrint Arch. 2022: 1181 (2022) - Paolo Santini, Marco Baldi, Franco Chiaraluce:
Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems. IACR Cryptol. ePrint Arch. 2022: 1749 (2022) - 2021
- Juan Ulloa:
Computational complexity of decisions: Quantifying computational hardness and its effects on human computation. University of Melbourne, Parkville, Victoria, Australia, 2021 - Vladimir Gurvich, Mikhail N. Vyalyi:
On Computational Hardness of Multidimensional Subtraction Games. Algorithms 14(3): 71 (2021) - Hemanta K. Maji:
Computational Hardness of Collective Coin-Tossing Protocols. Entropy 23(1): 44 (2021) - Hemanta K. Maji, Mingyuan Wang:
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt. CRYPTO (2) 2021: 33-63 - Thomas Chen, Xi Chen, Binghui Peng, Mihalis Yannakakis:
Computational Hardness of the Hylland-Zeckhauser Scheme. CoRR abs/2107.05746 (2021) - Tamir Bendory, Oscar Mickelin, Amit Singer:
Sparse multi-reference alignment: sample complexity and computational hardness. CoRR abs/2109.11656 (2021) - Thomas Attema, Nicole Gervasoni, Michiel Marcus, Gabriele Spini:
Post-Quantum Cryptography: Computational-Hardness Assumptions and Beyond. IACR Cryptol. ePrint Arch. 2021: 571 (2021) - Hemanta K. Maji, Mingyuan Wang:
Computational Hardness of Optimal FairComputation: Beyond Minicrypt. IACR Cryptol. ePrint Arch. 2021: 882 (2021) - 2020
- Kei Kimura:
Stronger Hardness Results on the Computational Complexity of Picross 3D. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(4): 668-676 (2020) - Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody:
Adversarially Robust Learning Could Leverage Computational Hardness. ALT 2020: 364-385 - Vladimir Gurvich, Mikhail N. Vyalyi:
Computational Hardness of Multidimensional Subtraction Games. CSR 2020: 237-249 - Nitin Yadav, Carsten Murawski, Sebastian Sardiña, Peter Bossaerts:
Is Hardness Inherent in Computational Problems? Performance of Human and Electronic Computers on Random Instances of the 0-1 Knapsack Problem. ECAI 2020: 498-505 - Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Computational Hardness of Certifying Bounds on Constrained PCA Problems. ITCS 2020: 78:1-78:29 - Tianyi Lin, Nhat Ho, Xi Chen, Marco Cuturi, Michael I. Jordan:
Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm. NeurIPS 2020 - Vladimir Gurvich, Michael N. Vyalyi:
Computational Hardness of Multidimensional Subtraction Games. CoRR abs/2001.03962 (2020)
skipping 35 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-26 18:18 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint