Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)

1998 ◽  
Keyword(s):  
Computational Complexity ◽  
Complexity Theory

scholarly journals The trouble with the second quantifier

4OR ◽  
2021 ◽  
Author(s):  
Gerhard J. Woeginger
Keyword(s):  
Computational Complexity ◽  
Robust Optimization ◽  
Complexity Theory ◽  
Operational Research ◽  
Optimization Problems ◽  
Bilevel Optimization ◽  
Theoretical Background ◽  
Research Community ◽  
Universal Quantifier ◽  
Computational Complexity Theory

AbstractWe survey optimization problems that allow natural simple formulations with one existential and one universal quantifier. We summarize the theoretical background from computational complexity theory, and we present a multitude of illustrating examples. We discuss the connections to robust optimization and to bilevel optimization, and we explain the reasons why the operational research community should be interested in the theoretical aspects of this area.

The future of computational complexity theory: part II

1996 ◽  
Vol 27 (4) ◽  
pp. 3-7
Author(s):  
E. Allender ◽  
J. Feigenbaum ◽  
J. Goldsmith ◽  
T. Pitassi ◽  
S. Rudich
Keyword(s):  
Computational Complexity ◽  
Complexity Theory ◽  
Computational Complexity Theory ◽  
The Future

scholarly journals Computational Complexity Theory and the Philosophy of Mathematics†

2019 ◽  
Vol 27 (3) ◽  
pp. 381-439
Author(s):  
Walter Dean
Keyword(s):  
Computational Complexity ◽  
Computer Science ◽  
Complexity Theory ◽  
Philosophy Of Mathematics ◽  
Computability Theory ◽  
Computational Complexity Theory ◽  
Mathematical Problems ◽  
Np Problem

Abstract Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof.

scholarly journals Incremental FPT Delay

Algorithms ◽  
2020 ◽  
Vol 13 (5) ◽  
pp. 122
Author(s):  
Arne Meier
Keyword(s):  
Computational Complexity ◽  
Complexity Theory ◽  
Complexity Classes ◽  
Computational Complexity Theory ◽  
Function Classes ◽  
Classical Setting ◽  
Classical Function ◽  
Multivalued Functions ◽  
Relationship Of ◽  
The Relationship

In this paper, we study the relationship of parameterized enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa and CapIncFPTa) of enumeration complexity classes for incremental fpt-time in terms of exponent slices and show how they interleave. Furthermore, we define several parameterized function classes and, in particular, introduce the parameterized counterpart of the class of nondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist, TFNP, known from Megiddo and Papadimitriou (TCS 1991). We show that this class TF(para-NP), the restriction of the function variant of NP to total functions, collapsing to F(FPT), the function variant of FPT, is equivalent to the result that OutputFPT coincides with IncFPT. In addition, these collapses are shown to be equivalent to TFNP = FP, and also equivalent to P equals NP intersected with coNP. Finally, we show that these two collapses are equivalent to the collapse of IncP and OutputP in the classical setting. These results are the first direct connections of collapses in parameterized enumeration complexity to collapses in classical enumeration complexity, parameterized function complexity, classical function complexity, and computational complexity theory.

LOGIC OF COMPUTATIONAL COMPLEXITY

2018 ◽  
pp. 94-109
Author(s):  
I. Petik
Keyword(s):  
Computational Complexity ◽  
Modal Logic ◽  
Computer Science ◽  
Complexity Theory ◽  
Methodological Approach ◽  
Philosophy Of Mathematics ◽  
Algorithmic Complexity ◽  
Science Philosophy ◽  
Methodological Approaches ◽  
First Time

The paper centers on building the semantics of the modal metatheory for studying the classes of algorithmic complexity. Further the effectiveness of this calculus is studied on the example of researching the famous problem of computational complexity theory – the question of equality of the classes P and NP. The new theoretical and methodological approach to the problem is provided. The original semantics was developed that can be used for description of relations between classes of algorithmic complexity from the complexity theory. On the basis of this semantics the complete calculus of the logic of the computational complexity can be developed in future. It is the first time when modal logic is used for studying the relations between classes of algorithmic complexity. New theoretical and methodological approaches to the classical problems of the complexity theory are proposed. Paper matters for computer science, philosophy of mathematics, logic and theory of algorithms, cryptography.

scholarly journals QUANTUM DISCORD AND QUANTUM COMPUTING — AN APPRAISAL

2011 ◽  
Vol 09 (07n08) ◽  
pp. 1787-1805 ◽  
Author(s):  
ANIMESH DATTA ◽  
ANIL SHAJI
Keyword(s):  
Quantum Computing ◽  
Computational Complexity ◽  
Complexity Theory ◽  
Quantum Discord ◽  
Primary Motivation ◽  
Classical Simulation ◽  
Classical Correlations ◽  
Quantum And Classical Correlations ◽  
Theory Lead

We discuss models of computing that are beyond classical. The primary motivation is to unearth the cause of non-classical advantages in computation. Completeness results from computational complexity theory lead to the identification of very disparate problems, and offer a kaleidoscopic view into the realm of quantum enhancements in computation. Emphasis is placed on the "power of one qubit" model, and the boundary between quantum and classical correlations as delineated by quantum discord. A recent result by Eastin on the role of this boundary in the efficient classical simulation of quantum computation is discussed. Perceived drawbacks in the interpretation of quantum discord as a relevant certificate of quantum enhancements are addressed.

Sign in / Sign up

Export Citation Format

Share Document