Search
Selected: All

A Physics-Free Introduction to the Quantum Computation Model

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A polynomial time (heuristic) SAT algorithm

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Polynomial Time Algorithm for 3-SAT

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Polynomial Time Algorithm for Graph Isomorphism

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Polynomial Time Algorithm for SAT

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Polynomial Time Nilpotence Test for Galois Groups and Related Results

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Polynomial-time Algorithm for Computing the Permanent in GF(3^q)

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A polynomial-time heuristic for Circuit-SAT

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Proof for P =? NP Problem

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision Branching Programs

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Quantifier-Free String Theory for ALOGTIME Reasoning

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A randomized polynomial-time algorithm for the Spanning Hypertree Problem on 3-uniform hypergraphs

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Recursive Definition of the Holographic Standard Signature

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Relation between the Protocol Partition Number and the Quasi-Additive Bound

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time"

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Representation of Changes of Images and its Application for Developmental Biolology

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.