Results 201 to 210 of about 1,491,574 (265)
Some of the next articles are maybe not open access.
Computational Complexity Theory
IAS/Park City Mathematics Series, 2004Week One: Complexity theory: From Godel to Feynman Complexity theory: From Godel to Feynman History and basic concepts Resources, reductions and P vs. NP Probabilistic and quantum computation Complexity classes Space complexity and circuit complexity Oracles and the polynomial time hierarchy Circuit lower bounds "Natural" proofs of lower bounds ...
S. Rudich, A. Wigderson
openaire +2 more sources
Computational Complexity Theory
1989Overview of computational complexity theory by J. Hartmanis The isomorphism conjecture and sparse sets by S. R. Mahaney Restricted relativizations of complexity classes by R. V. Book Descriptive and computational complexity by N. Immerman Complexity issues in cryptography by A. L. Selman Interactive proof systems by S. Goldwasser.
J. Hartmanis
openaire +2 more sources
ACM Computing Surveys, 1996 Computational Complexity Theory
Encyclopedia of Optimization, 2001Hamilton Emmons, Sanatan Rai
openaire +2 more sources
SIGACT News Complexity Theory Column 124 Meta-Mathematics of Computational Complexity Theory
Sigact NewsWe survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory.
I. C. Oliveira
semanticscholar +1 more source
A Generalized Quantifier Concept in Computational Complexity Theory
European Summer School in Logic, Language and Information, 1997A notion of generalized quantifier in computational complexity theory is explored and used to give a unified treatment of leaf language definability, oracle separations, type 2 operators, and circuits with monoidal gates.
H. Vollmer
semanticscholar +1 more source
Local vs. Global Interpretability: A Computational Complexity Perspective
International Conference on Machine LearningThe local and global interpretability of various ML models has been studied extensively in recent years. However, despite significant progress in the field, many known results remain informal or lack sufficient mathematical rigor.
Shahaf Bassan, Guy Amir, Guy Katz
semanticscholar +1 more source
Progress in Computational Complexity Theory
Journal of Computer Science and Technology, 2005We briefly survey a number of important recent achievements in Theoretical Computer Science (TCS), especially Computational Complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability on combinatorial optimization problems; space bounded computations, especially deterministic logspace algorithm for undirected graph ...
Jin-Yi Cai, Hong Zhu
openaire +1 more source