-
1
-
2
Extensions of Presburger arithmetic and model checking one-counter automata
प्रकाशित 2016विषय: “…Computational Complexity Theory…”
थीसिस -
3
On nonintegral vertices of 3-SAT problem relaxation polytope
प्रकाशित 2010-06-01विषय: पूर्ण पाठ प्राप्त करें
लेख -
4
P Systems with Evolutional Communication and Division Rules
प्रकाशित 2021-11-01विषय: पूर्ण पाठ प्राप्त करें
लेख -
5
18.404J / 6.840J Theory of Computation, Fall 2006
प्रकाशित 2021विषय: “…Computability, computational complexity theory…”
पूर्ण पाठ प्राप्त करें
Learning Object -
6
18.404J / 6.840J Theory of Computation, Fall 2002
प्रकाशित 2002विषय: पूर्ण पाठ प्राप्त करें
Learning Object -
7
Discrete Computation: Theory and Open Problems
प्रकाशित 2023“…Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. …”
पूर्ण पाठ प्राप्त करें
-
8
The Spectral Norm of Finite Functions
प्रकाशित 2023“…In many recent results in learning and computational complexity theory which rely on Fourier analysis, the spectral norm plays a key role. …”
पूर्ण पाठ प्राप्त करें
-
9
A model-independent theory of computational complexity: from patience to precision and beyond
प्रकाशित 2010“…<p>The field of computational complexity theory--which chiefly aims to quantify the difficulty encountered when performing calculations--is, in the case of conventional computers, correctly practised and well understood (some important and fundamental open questions notwithstanding); however, such understanding is, we argue, lacking when unconventional paradigms are considered. …”
थीसिस -
10
Nonsequential Computation and Laws of Nature
प्रकाशित 2023“…Traditionally, computational complexity theory deals with sequential computations. …”
पूर्ण पाठ प्राप्त करें
-
11
QUANTUM DISCORD AND QUANTUM COMPUTING - AN APPRAISAL
प्रकाशित 2011“…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. …”
Journal article -
12
Computational Structure of GPSG Models: Revised Generalized Phrase Structure Grammar
प्रकाशित 2004“…The primary goal of this report is to demonstrate how considerations from computational complexity theory can inform grammatical theorizing. …”
पूर्ण पाठ प्राप्त करें
-
13
Complexity of Computation of Dominating Sets in Geo-Mathmetics Algorithm : A Review
प्रकाशित 2021-02-01“…The dominant sets problem by testing whether γ (G) ≤ K of a given graph is G and K input; It is an electronic card NP machines decision problem in computational complexity theory. Infographics, powerful infographics plus graphic mapping. …”
पूर्ण पाठ प्राप्त करें
लेख -
14
Incremental FPT Delay
प्रकाशित 2020-05-01“…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.…”
पूर्ण पाठ प्राप्त करें
लेख -
15
Contracting projected entangled pair states is average-case hard
प्रकाशित 2020-01-01“…In higher dimensions, however, a connection to the field of computational complexity theory has shown that the accurate normalization of the two-dimensional tensor networks called projected entangled pair states (PEPS) is #P-complete. …”
पूर्ण पाठ प्राप्त करें
लेख -
16
A Survey of Noninteractive Zero Knowledge Proof System and Its Applications
प्रकाशित 2014-01-01“…Zero knowledge proof system which has received extensive attention since it was proposed is an important branch of cryptography and computational complexity theory. Thereinto, noninteractive zero knowledge proof system contains only one message sent by the prover to the verifier. …”
पूर्ण पाठ प्राप्त करें
लेख -
17
Unconventional complexity measures for unconventional computers
प्रकाशित 2011“…One particular motivation behind unconventional computation is the desire efficiently to solve classically difficult problems—we recall chemical-computer attempts at solving NP-complete problems such as the Travelling Salesperson Problem—, with computational complexity theory offering the criteria for judging this efficiency. …”
Journal article -
18
R-prime numbers of degree k
प्रकाशित 2018-02-01“…Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. …”
पूर्ण पाठ प्राप्त करें
लेख -
19
Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
प्रकाशित 2024-06-01“…Thus, our findings provide a meaningful connection between steering, entanglement, quantum algorithms, and quantum computational complexity theory. They also demonstrate the value of a parameterized mid-circuit measurement in a VQSA.…”
पूर्ण पाठ प्राप्त करें
लेख -
20
Real-Time Trading System Based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-Hard Combinatorial Optimization
प्रकाशित 2023-01-01“…Financial portfolio construction problems are often formulated as quadratic and discrete (combinatorial) optimization that belong to the nondeterministic polynomial time (NP)-hard class in computational complexity theory. Ising machines are hardware devices that work in quantum-mechanical/quantum-inspired principles for quickly solving NP-hard optimization problems, which potentially enable making trading decisions based on NP-hard optimization in the time constraints for high-speed trading strategies. …”
पूर्ण पाठ प्राप्त करें
लेख