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

Hämta fulltext

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

Ämnen: “…Computational Complexity Theory…”

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

Ämnen: Hämta fulltext

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

Ämnen: Hämta fulltext

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

Ämnen: “…Computability, computational complexity theory…”
Hämta fulltext

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

Ämnen: Hämta fulltext

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

“…Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. …”
Hämta fulltext

The Spectral Norm of Finite Functions av Bellare, Mihir

“…In many recent results in learning and computational complexity theory which rely on Fourier analysis, the spectral norm plays a key role. …”
Hämta fulltext

A model-independent theory of computational complexity: from patience to precision and beyond av 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 av Vitányi, Paul M.B.

“…Traditionally, computational complexity theory deals with sequential computations. …”
Hämta fulltext

QUANTUM DISCORD AND QUANTUM COMPUTING - AN APPRAISAL av 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 av Ristad, Eric Sven

“…The primary goal of this report is to demonstrate how considerations from computational complexity theory can inform grammatical theorizing. …”
Hämta fulltext

Complexity of Computation of Dominating Sets in Geo-Mathmetics Algorithm : A Review av Ş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. …”
Hämta fulltext

Incremental FPT Delay av 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.…”
Hämta fulltext

Contracting projected entangled pair states is average-case hard av 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. …”
Hämta fulltext

A Survey of Noninteractive Zero Knowledge Proof System and Its Applications av 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. …”
Hämta fulltext

Unconventional complexity measures for unconventional computers av 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 av Abdelhakim Chillali

“…Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. …”
Hämta fulltext

Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering av 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.…”
Hämta fulltext

Real-Time Trading System Based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-Hard Combinatorial Optimization av 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. …”
Hämta fulltext