Search results

...'''union theorem''' is a result from the 60s in [[computational complexity theory]]. It was published<ref name="MM"> | conference = ACM Symposium on Theory of Computing ...

...ut|the area in computer science|the area in applied mathematics|Structural complexity (applied mathematics)}} ...Automata, Languages and Programming]], 1988 (ICALP 88), ''[[Lecture Notes in Computer Science]]'', vol. 317 (1988), pp. 271-286.</ref> ...

...ion|The polynomial hierarchy is contained in probabilistic Turing machine in polynomial time}} ...[[computational complexity theory]] that was proven by [[Seinosuke Toda]] in his paper "PP is as Hard as the Polynomial-Time Hierarchy"<ref>{{Cite journ ...

...ed algorithm|probabilistic]] [[polynomial-time]] algorithms into [[Circuit complexity|non-uniform polynomial-size circuits]]. '''Example:''' If every person likes at least 1/3 of the books in a library, then the library has a book, which at least 1/3 of people like. ...

{{short description|On the complexity classes of problems about satisfying a subset of boolean relations}} ...r, the Max/min CSP/Ones classification theorems give information about the complexity of [[approximation algorithm|approximating]] an optimal solution to a probl ...

...by [[Joseph O'Rourke (professor)|Joseph O'Rourke]], and published in 1987 in the International Series of Monographs on Computer Science of the [[Oxford ...ore generally, the book has as a theme "the interplay between discrete and computational geometry".{{r|avis}} ...

...polynomial-size proofs in these systems. The characterization of standard complexity classes and correspondence to propositional proof systems allows to interpr ...Feasibility in Arithmetic, Jour. Symbolic Logic 36 (1971) 494–508.</ref> in 1971, and later developed by [[Samuel Buss|Samuel R. Buss]]. <ref name="bus ...

{{Short description|System of arithmetic in proof theory}} {{redirect|Elementary recursive arithmetic|the computational complexity class|Elementary recursive function}} ...

{{Short description|Principle in control theory}} ...on_theorem|Riesz' representation theorem]], which is a fundamental theorem in functional analysis. The name was coined by [[I. Michael Ross|Ross]] and c ...

{{Short description|Theorem in computational and discrete geometry}} [[File:Zone theorem.svg|thumb|upright=1.35|The zone of a line (red) in an arrangement of lines, consisting of all faces that touch the given line] ...

{{Machine learning|Theory}} In [[computational learning theory]], '''Occam learning''' is a model of algorithmic learning where the object ...

...ield of [[computational complexity theory]] that studies the complexity of computational problems on "most inputs". Generic-case complexity is a way of measuring the complexity of a [[computational problem]] by neglecting a small set of ...

...[[decidability (logic)|decidability]] of the [[theory (mathematical logic)|theory]] of [[real-closed field]]s. ...nents. This algorithm is therefore fundamental, and it is widely used in [[computational algebraic geometry]]. ...

...bjects (represented as [[computer]] files) expressed as the number of bits in the shortest program which transforms one object into the other one or vice ...he Kolmogorov complexity of a ''single'' finite object is the information in that object; the information distance between a ''pair'' of finite objects ...

...].<ref name="Val84">[http://dl.acm.org/citation.cfm?id=1972 L. Valiant ''A theory of the learnable''. Communications of ACM, 1984]</ref> ...s have been drawn. Because of its generality, this framework has been used in a large variety of different fields like [[machine learning]], [[approximat ...

{{Distinguish|text=the [[Gödel Prize]]}}{{Short description|Award in mathematical logic}} The '''Gödel Lecture''' is an honor in [[mathematical logic]] given by the [[Association for Symbolic Logic]], ass ...

{{Short description|Mathematical model in economics}} ...pdf Economic lot sizing: an O (n log n) algorithm that runs in linear time in the Wagner-Whitin case]." Operations Research 40.1-Supplement - 1 (1992): S ...

| fields = [[Computer science]]<br/>[[Computational biology]]<ref name=gs/> ...]]. Gusfield is known for his research in combinatorial optimization and computational biology.<ref name=gs>{{Google scholar id}}</ref> ...

{{short description|Every square matrix with positive entries can be written in a certain standard form}} ...' states that every [[square matrix]] with positive entries can be written in a certain standard form. ...

In [[graph theory]], the '''thickness''' of a graph {{mvar|G}} is the minimum number of [[pla .../2009/cccg09_04.pdf On Graph Thickness, Geometric Thickness, and Separator Theorems], CCCG 2009, Vancouver, BC, August 17–19, 2009</ref> ...