Some hardness escalation results in computational complexity theory Dahkki Kamath, Pritish.

Viečča ollesdeavstta

Extensions of Presburger arithmetic and model checking one-counter automata Dahkki Lechner, A

Fáttát: “…Computational Complexity Theory…”

On nonintegral vertices of 3-SAT problem relaxation polytope Dahkki A. V. Nikolaev

Fáttát: Viečča ollesdeavstta

P Systems with Evolutional Communication and Division Rules Dahkki David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez

Fáttát: Viečča ollesdeavstta

18.404J / 6.840J Theory of Computation, Fall 2006 Dahkki Sipser, Michael

Fáttát: “…Computability, computational complexity theory…”
Viečča ollesdeavstta

18.404J / 6.840J Theory of Computation, Fall 2002 Dahkki Sipser, Michael

Fáttát: Viečča ollesdeavstta

Discrete Computation: Theory and Open Problems Dahkki Meyer, Albert R.

“…Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. …”
Viečča ollesdeavstta

The Spectral Norm of Finite Functions Dahkki Bellare, Mihir

“…In many recent results in learning and computational complexity theory which rely on Fourier analysis, the spectral norm plays a key role. …”
Viečča ollesdeavstta

A model-independent theory of computational complexity: from patience to precision and beyond Dahkki Blakey, E

“…<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. …”

Nonsequential Computation and Laws of Nature Dahkki Vitányi, Paul M.B.

“…Traditionally, computational complexity theory deals with sequential computations. …”
Viečča ollesdeavstta

QUANTUM DISCORD AND QUANTUM COMPUTING - AN APPRAISAL Dahkki Datta, A, Shaji, A

“…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. …”

Computational Structure of GPSG Models: Revised Generalized Phrase Structure Grammar Dahkki Ristad, Eric Sven

“…The primary goal of this report is to demonstrate how considerations from computational complexity theory can inform grammatical theorizing. …”
Viečča ollesdeavstta

Complexity of Computation of Dominating Sets in Geo-Mathmetics Algorithm : A Review Dahkki Şakir Işleyen

“…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. …”
Viečča ollesdeavstta

Incremental FPT Delay Dahkki Arne Meier

“…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.…”
Viečča ollesdeavstta

Contracting projected entangled pair states is average-case hard Dahkki Jonas Haferkamp, Dominik Hangleiter, Jens Eisert, Marek Gluza

“…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. …”
Viečča ollesdeavstta

A Survey of Noninteractive Zero Knowledge Proof System and Its Applications Dahkki Huixin Wu, Feng Wang

“…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. …”
Viečča ollesdeavstta

Unconventional complexity measures for unconventional computers Dahkki Blakey, E

“…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. …”

R-prime numbers of degree k Dahkki Abdelhakim Chillali

“…Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. …”
Viečča ollesdeavstta

Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering Dahkki Aby Philip, Soorya Rethinasamy, Vincent Russo, Mark M. Wilde

“…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.…”
Viečča ollesdeavstta

Real-Time Trading System Based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-Hard Combinatorial Optimization Dahkki Kosuke Tatsumura, Ryo Hidaka, Jun Nakayama, Tomoya Kashimata, Masaya Yamasaki

“…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. …”
Viečča ollesdeavstta