Lower bounds for monotone real circuit depth and formula size and tree-like Cutting Planes

Jan Johannsen

doi:10.1016/s0020-0190(98)00079-9

ScienceGate Book Chapters

JOURNAL ARTICLE

Lower bounds for monotone real circuit depth and formula size and tree-like Cutting Planes

Jan Johannsen

Year: 1998 Journal: Information Processing Letters Vol: 67 (1)Pages: 37-41 Publisher: Elsevier BV

DOI: 10.1016/s0020-0190(98)00079-9

Get Full-Text PDF Get Analytical Report

Keywords:

Monotone polygon Mathematical proof Tree (set theory) Mathematics Upper and lower bounds Circuit complexity Combinatorics Discrete mathematics Polynomial Electronic circuit Geometry Mathematical analysis

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.03

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Lower bounds for monotone real circuit depth and formula size and tree-like Cutting Planes

Metrics

Topics

Related Documents

Upper and lower bounds for tree-like cutting planes proofs

Monotone Depth Lower Bounds

Monotone circuit lower bounds from resolution

Higher lower bounds on monotone size

Monotone Circuit Lower Bounds from Robust Sunflowers