Back to Results
First PageMeta Content
Complexity classes / Circuit complexity / ACC0 / Time complexity / PP / NTIME / P / AC / Natural proof / Theoretical computer science / Computational complexity theory / Applied mathematics


Non-Uniform ACC Circuit Lower Bounds Ryan Williams∗ IBM Almaden Research Center
Add to Reading List

Document Date: 2010-11-23 15:55:39


Open Document

File Size: 502,58 KB

Share Result on Facebook

Company

IBM / CNF / 3SAT / /

IndustryTerm

faster algorithms / faster algorithm / nondeterministic algorithm / satisfiability algorithms / satisfiability algorithm / exponential algorithms / rectangular matrix multiplication algorithm / nondeterministic algorithms / faster satisfiability algorithms / improved satisfiability algorithms / exhaustive search / target algorithm / /

Organization

US Federal Reserve / Non-Uniform ACC Circuit Lower Bounds Ryan Williams∗ IBM Almaden Research Center / /

Person

Santhanam / /

Position

author / /

Product

Tseitin / /

ProgrammingLanguage

C / /

ProvinceOrState

Oregon / /

Technology

slightly faster algorithm / faster algorithm / satisfiability algorithms / satisfiability algorithm / RAM / good algorithm / known improved satisfiability algorithms / target algorithm / rectangular matrix multiplication algorithm / sufficiently faster satisfiability algorithms / AT algorithm / Improved exponential algorithms / time algorithm / nondeterministic algorithm / underlying ACC SAT algorithm / SAT algorithm / random access / weak ACC satisfiability algorithms / source algorithm / ACC SAT algorithm / assumed ACC satisfiability algorithm / SAT algorithms / ACC satisfiability algorithm / AT algorithms / faster ACC satisfiability algorithm / /

SocialTag