Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,

Source URL: cjtcs.cs.uchicago.edu

• NP-complete problems
• Conjunctive normal form
• Combinatorics
• Boolean satisfiability problem
• String
• Permutation
• PP
• 2-satisfiability
• MAX-3SAT
• Theoretical computer science
• Mathematics
• Computational complexity theory

Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds∗ Yuval Filmus University of Toronto Massimo Lauria

Source URL: www.cs.toronto.edu

• Computational complexity theory
• Conjunctive normal form
• Proof complexity
• PP
• IP
• Polynomial
• Boolean algebra
• Frege system
• MAX-3SAT
• Theoretical computer science
• Applied mathematics
• Logic in computer science

manhat-conn-xact-color.dvi

Source URL: daniel-wilkerson.appspot.com

• NP-complete problems
• Graph coloring
• Graph theory
• NP-complete
• One-in-three 3SAT
• 2-satisfiability
• Theoretical computer science
• Mathematics
• Computational complexity theory

1 EGRES Quick-Proof No[removed]Finding edge-disjoint subgraphs in graphs Attila Bern´ath? and Zolt´an Kir´aly

Source URL: www.cs.elte.hu

• Spanning tree
• NP-complete problems
• One-in-three 3SAT
• Tree
• Theoretical computer science
• Mathematics
• Computational complexity theory

Revenue Maximization via Hiding Item Attributes

Source URL: cgi.csc.liv.ac.uk

• Algebraic topology
• Algebraic geometry
• Ample line bundle
• Differential topology
• One-in-three 3SAT
• Fiber bundles
• Topology
• Vector bundles
• Abstract algebra

eZürich Inhalt TV-Tipp: eZürich bei 3sat «Züri wie neu» geht online Stadt Zürich gewinnt an den «Best of Swiss Web Awards» Umzug innerhalb der Stadt Zürich online melden

Source URL: www.ezuerich.ch

Feuer der Erinnerung Medizin-Nobelpreisträger Eric Kandel im Gespräch mit Gert Scobel in Berlin Feuer der Erinnerung Medizin-Nobelpreisträger Eric Kandel im Gespräch mit Gert Scobel in Berlin

Source URL: www.3sat.de

The Local Lemma is tight for SAT∗ H. Gebauer †, T. Szab´o ‡, G. Tardos § Abstract

Source URL: www.renyi.hu

• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Logic in computer science
• Hypergraph
• Unsatisfiable core
• Exponential time hypothesis
• MAX-3SAT
• Theoretical computer science
• Mathematics
• Applied mathematics

AdWords and Generalized On-line Matching Aranyak Mehta Amin Saberi Umesh Vazirani

Source URL: www.stanford.edu

• Mathematics
• Applied mathematics
• Computer science
• MAX-3SAT
• Complex analysis
• Pi
• Randomized algorithm

2008 Editorial Ab 27. April rollt der „Balkan Express“ durch das Programm von 3sat und ab September im ORF. Die 10-teilige TV-Dokumentation gehört zu den

Source URL: www.esiweb.org