A Counterexample to the Generalized Linial-Nisan Conjecture Scott Aaronson∗ Abstract In earlier work [1], we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an ora

Source URL: www.scottaaronson.com

• Quantum complexity theory
• Bounded-error probabilistic polynomial
• Pseudorandom generator
• Fourier transform
• IP
• FO
• Theoretical computer science
• Applied mathematics
• PP

Max’s statements http://topdrawer.aamt.edu.au/Reasoning/Big-ideas/Deduction/Deductive-reasoning A year 7 teacher described the following scenario to her mathematics class. Playing around with adding integers (whole num

Source URL: topdrawer.aamt.edu.au

• Reasoning
• Mathematical logic
• Epistemology
• Problem solving
• Logical consequence
• Mathematical proof
• Deductive reasoning
• Counterexample
• Reason
• Mathematics
• Logic
• Knowledge

Counterexample-guided Cartesian Abstraction Refinement Jendrik Seipp and Malte Helmert Universit¨at Basel Basel, Switzerland {jendrik.seipp,malte.helmert}@unibas.ch

Source URL: ai.cs.unibas.ch

• Philosophy of mind
• Programming paradigms
• Theoretical computer science
• Model checking
• Abstraction
• Logic in computer science
• Concept
• Heuristic function
• Combinatory logic
• Thought
• Cognition
• Mind

Additive Counterexample-guided Cartesian Abstraction Refinement Jendrik Seipp and Malte Helmert Universit¨at Basel Basel, Switzerland {jendrik.seipp,malte.helmert}@unibas.ch

Source URL: ai.cs.unibas.ch

• Science
• Heuristic function
• Admissible heuristic
• Heuristic
• Abstraction
• Consistent heuristic
• Friedrich Robert Helmert
• Algorithm
• Shortest path problem
• Heuristics
• Mathematics
• Applied mathematics

MATH 101 V2A – Homework April 1st State whether each of the following statements are true or false. If true, provide justification. If false, provide a counterexample. 1. If x > 0, then log(x) = log(1 + (x − 1)) =

Source URL: www.ugrad.math.ubc.ca

A Counterexample to Tensorability of Effects Sergey Goncharov and Lutz Schr¨ oder September 1, 2011

Source URL: calco2011.ecs.soton.ac.uk

• Abstract algebra
• Monad
• Tensor
• Homogeneous polynomial
• Rank
• Strong monad
• Algebra
• Adjoint functors
• Mathematics

Counterexample Guided Path Reduction for Static Program Analysis Ansgar Fehnker, Ralf Huuck, and Sean Seefried National ICT Australia Ltd. (NICTA)? Locked Bag 6016 University of New South Wales

Source URL: www.cse.unsw.edu.au

• Differential equation
• Function
• Mathematics
• Logarithms
• Substitution of variables

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Direct Planar Tree Transformation and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen’s University Kingston, Ontario, Canada K

Source URL: cccg.ca

• Planar graphs
• Tree
• Pseudotriangle
• Graph
• Delaunay triangulation
• Line graph
• Tutte polynomial
• Graph theory
• Mathematics
• Triangulation

CEGAR algorithm Evaluation Counterexample-guided Cartesian Abstraction Refinement Jendrik Seipp, Malte Helmert

Source URL: ai.cs.unibas.ch

• Mathematics
• Algorithms
• Knowledge representation
• Medical algorithm

A How Can Automatic Feedback Help Students Construct Automata? LORIS D’ANTONI, University of Pennsylvania DILEEP KINI, University of Illinois at Urbana-Champaign RAJEEV ALUR, University of Pennsylvania

Source URL: research.microsoft.com

• Computer science
• Applied mathematics
• Deterministic finite automaton
• Nondeterministic finite automaton
• DFA Records
• Finite-state machine
• Algorithm
• Counterexample
• Regular expression
• Automata theory
• Models of computation
• Theoretical computer science