Related papers: Take-home Complexity
We survey recent applications of topology and singularity theory in the study of the algebraic complexity of concrete optimization problems in applied algebraic geometry and algebraic statistics.
Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. We seek to…
Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.
Complexity remains one of the central challenges in science and technology. Although several approaches at defining and/or quantifying complexity have been proposed, at some point each of them seems to run into intrinsic limitations or…
We provide a framework connecting several well known theories related to the linearity of graded modules over graded algebras. In the first part, we pay a particular attention to the tensor products of graded bimodules over graded algebras.…
We report our experience in two installations of a course on data visualization that featured project-based learning. Given the rationale of this approach, we show which input was provided when necessary for the students to achieve their…
The term {\em complexity} is used informally both as a quality and as a quantity. As a quality, complexity has something to do with our ability to understand a system or object -- we understand simple systems, but not complex ones. On…
We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correct protocols, one-way versus two-way, with and without help…
This article is a survey of recent developments in, and a tutorial on, the approach to P v. NP and related questions called Geometric Complexity Theory (GCT). It is written to be accessible to graduate students. Numerous open questions in…
The best way to model, understand, and quantify the information contained in complex systems is an open question in physics, mathematics, and computer science. The uncertain relationship between entropy and complexity further complicates…
Complex network theory is being widely used to study many real-life systems. One of the fields that can benefit from complex network theory approach is transportation network. In this paper, we briefly review the complex network theory…
In many upper-division lab courses, instructors implement multiweek student-led projects. During such projects, students may design and carry out experiments, collect and analyze data, document and report their findings, and collaborate…
Complex systems have become a popular lens for analyzing cities and complexity theory has many implications for urban performance and resilience. This paper develops a typology of measures and indicators for assessing the physical…
Theory of Computing (ToC) is an important course in CS curricula because of its connections to other CS courses as a foundation for them. Traditional ToC course grading schemes are mostly exam-based, and sometimes a small weight for…
An important goal of graduate physics core courses is to help students develop expertise in problem solving and improve their reasoning and meta-cognitive skills. We explore the conceptual difficulties of physics graduate students by…
In this talk I describe a recently introduced field-theoretical approach that can be used as an alternative framework to study one-dimensional systems of highly correlated particles.
An outline of recent work on complex networks is given from the point of view of a physicist. Motivation, achievements and goals are discussed with some of the typical applications from a wide range of academic fields. An introduction to…
Discrete mathematics and probability theory contain foundational material for computer scientists. Despite their importance, instructors often worry that students will find these courses to be too abstract and seemingly disconnected from…
We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis (cost…
This chapter serves as an introduction to systems engineering focused on the broad issues surrounding realizing complex integrated systems. What is a system? We pose a number of possible definitions and perspectives, but leave open the…