Остановите войну!
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
Exact matches
Likely matches
- ACM/IEEE Symposium on Logic in Computer Science (LICS)
also: Workshop on Implicit Computational Complexity (ICC @ LICS) - Computational Complexity Conference (CCC)
also: IEEE Conference on Computational Complexity (CCC) - Computational Complexity
- Electronic Colloquium on Computational Complexity (ECCC)
- Joint Workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis (DICE-FOPARA)
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 2,514 matches
- 2024
- Bernhard Nebel:
The computational complexity of multi-agent pathfinding on directed graphs. Artif. Intell. 328: 104063 (2024) - Jakob Stenseke:
On the computational complexity of ethics: moral tractability for minds and machines. Artif. Intell. Rev. 57(4): 105 (2024) - Marco Scutari:
Entropy and the Kullback-Leibler Divergence for Bayesian Networks: Computational Complexity and Efficient Implementation. Algorithms 17(1): 24 (2024) - Eduardo Sany Laber:
The computational complexity of some explainable clustering problems. Inf. Process. Lett. 184: 106437 (2024) - Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst. 68(1): 103-121 (2024) - Yogita M. Vaidya, Shilpa P. Metkar:
Computational Complexity Reduction of HEVC by Early Termination of Transform Unit Partitioning Using Raster Scan Approach. SN Comput. Sci. 5(1): 208 (2024) - Ghada F. El-Kabbany, Hassan I. Ahmed, Heba K. Aslan, Young-Im Cho, Mohamed S. Abdallah:
Lightweight Computational Complexity Stepping Up the NTRU Post-Quantum Algorithm Using Parallel Computing. Symmetry 16(1): 12 (2024) - Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara:
Computational complexity of jumping block puzzles. Theor. Comput. Sci. 983: 114292 (2024) - Hengzhao Ma, Jianzhong Li, Tianpeng Gao, Xiangyu Gao:
Turing machines with two-level memory: New computational models for analyzing the input/output complexity. Theor. Comput. Sci. 985: 114347 (2024) - Peng Yang, Yuan Huang, Zhiguo Fu:
The computational complexity of Holant problems on 3-regular graphs. Theor. Comput. Sci. 982: 114256 (2024) - Songtuan Lin, Conny Olz, Malte Helmert, Pascal Bercher:
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence. AAAI 2024: 20203-20211 - Seda Aslan, Xiaolong Liu, Enze Chen, Miya Mese-Jones, Bryan Gonzalez, Ryan O'Hara, Yue-Hin Loke, Narutoshi Hibino, Laura Olivieri, Axel Krieger, Thao D. Nguyen:
Computational Modeling of Arterial Walls: Evaluating Model Complexity and the Influence of Model Parameters on Deformation Outcomes. BIOSTEC (1) 2024: 454-461 - Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara:
On the Computational Complexity of Generalized Common Shape Puzzles. SOFSEM 2024: 55-68 - Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti, Aristides Gionis:
Diversity-aware clustering: Computational Complexity and Approximation Algorithms. CoRR abs/2401.05502 (2024) - Florian Neukart:
Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem. CoRR abs/2401.08668 (2024) - Jerry Yao-Chieh Hu, Thomas Lin, Zhao Song, Han Liu:
On Computational Limits of Modern Hopfield Models: A Fine-Grained Complexity Analysis. CoRR abs/2402.04520 (2024) - Daniel Malz, Rahul Trivedi:
Computational complexity of isometric tensor network states. CoRR abs/2402.07975 (2024) - Edwin Lock, Zephyr Qiu, Alexander Teytelboym:
The Computational Complexity of the Housing Market. CoRR abs/2402.08484 (2024) - Nina Pardal, Santiago Cifuentes, Edwin Pin, Maria Vanina Martinez, Sergio Abriola:
Computational Complexity of Preferred Subset Repairs on Data-Graphs. CoRR abs/2402.09265 (2024) - Moritz Lichter, Simon Raßmann, Pascal Schweitzer:
Computational complexity of the Weisfeiler-Leman dimension. CoRR abs/2402.11531 (2024) - Tim Lenz, Omar S. M. El Nahhas, Marta Ligero, Jakob Nikolas Kather:
Reducing self-supervised learning complexity improves weakly-supervised classification performance in computational pathology. CoRR abs/2403.04558 (2024) - Gregor Behnke, Marcel Steinmetz:
On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification: Technical Report. CoRR abs/2403.17826 (2024) - Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski:
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse. CoRR abs/2403.20000 (2024) - Sedigheh Khajouei-Nejad, Hamid Haj Seyyed Javadi, Sam Jabbehdari, Seyed Mohammad Hossein Moattar:
Reducing the computational complexity of fuzzy identity-based encryption from lattice. IACR Cryptol. ePrint Arch. 2024: 16 (2024) - 2023
- Tirukkattuppalli Subramanyam Arthanari:
Pedigree Polytopes - New Insights on Computational Complexity of Combinatorial Optimisation Problems. Springer 2023, ISBN 978-981-19-9951-2, pp. 1-204 - Tobias Hogrebe:
From Elections to Tournaments: A Study of the Computational Complexity of Bribery, Design, and Prediction Problems in Voting and Sports. Heinrich-Heine-Universität, Düsseldorf, Germany, 2023 - Christian Rieck:
Guarding and Reconfiguration: Computational Complexity and Algorithm Design. Braunschweig University of Technology, Germany, 2023 - Elif Tasdemir:
Computational Complexity and Delay Reduction for RLNC Single and Multi-hop Communications. Dresden University of Technology, Germany, 2023 - Muneeb Masood Raja, Haoran Wang, Muhammad Haseeb Arshad, Gregory J. Kish, Qing Zhao:
Data Driven Model Predictive Control for Modular Multilevel Converters With Reduced Computational Complexity. IEEE Access 11: 42113-42123 (2023) - Danveer Rajpal, Akhil Ranjan Garg:
Deep Learning Model for Recognition of Handwritten Devanagari Numerals With Low Computational Complexity and Space Requirements. IEEE Access 11: 49530-49539 (2023)
skipping 2,484 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-25 02:53 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