Results 1 to 10 of about 745,627 (235)
Reductions for Frequency-Based Data Mining Problems
, 2017 Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational complexity of many central problems in data mining. In this paper we study
Miettinen, Pauli, Neumann, Stefan
core +1 more source
Ranking Functions for Vector Addition Systems
, 2014 Vector addition systems are an important model in theoretical computer science and have been used for the analysis of systems in a variety of areas. Termination is a crucial property of vector addition systems and has received considerable interest in ...
Anders Sjödin (611183) +9 more
core +3 more sources
On partisan bias in redistricting: computational complexity meets the science of gerrymandering
CoRR, 2019 Disclaimer: The authors were not supported, financially or otherwise, by any political party. The research results reported in this paper are purely scientific and reported as they are without any regard to which political party they may be of help (if at all)
Tanima Chatterjee, Bhaskar DasGupta
openaire +2 more sources
, 2018 The linear space hypothesis is a practical working hypothesis, which originally states the insolvability of a restricted 2CNF Boolean formula satisfiability problem parameterized by the number of Boolean variables.
CA Kapoutsis +8 more
core +3 more sources
Unitary Noise and the Mermin-GHZ Game
, 2010 Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems.
Angelo Montanari +3 more
core +2 more sources
Computer science, computer, computational complexity
Chebyshevskii sbornik, 2021 Vladimir Nikolaevich Chubarikov +3 more
openaire +2 more sources
Quantifying Resource Use in Computations [PDF]
, 2009 It is currently not possible to quantify the resources needed to perform a computation. As a consequence, it is not possible to reliably evaluate the hardware resources needed for the application of algorithms or the running of programs. This is apparent
van Son, R. J. J. H.
core +1 more source
Analysis Of Computational Complexity Theory For Theoretical Computer Science Applications
İlköğretim Online, 2023 Computational Complexity Theory is a fundamental field in Theoretical Computer Science that analyzes the resources required to solve computational problems. It provides a framework for understanding the efficiency and limitations of algorithms, enabling us toclassify problems into different complexity classes based on their inherent difficulty.
openaire +1 more source
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
, 2007 We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over the domain {0,1}.
Homan, Christopher M., Kosub, Sven
core +3 more sources
Complex Systems and a Computational Social Science Perspective on the Labor Market
CoRR, 2016 Labor market institutions are central for modern economies, and their polices can directly affect unemployment rates and economic growth. At the individual level, unemployment often has a detrimental impact on people's well-being and health. At the national level, high employment is one of the central goals of any economic policy, due to its close ...
openaire +2 more sources