<--- Back to Details
First PageDocument Content
Computational complexity theory / Cognition / Neuropsychology / Structural complexity theory / Mathematics / Reduction / Problem solving / Algorithm / Heuristic / How to Solve It / Computational thinking
Date: 2009-03-16 13:42:11
Computational complexity theory
Cognition
Neuropsychology
Structural complexity theory
Mathematics
Reduction
Problem solving
Algorithm
Heuristic
How to Solve It
Computational thinking

Microsoft Word - fp16-armoni.doc

Add to Reading List

Source URL: www.openu.ac.il

Download Document from Source Website

File Size: 218,35 KB

Share Document on Facebook

Similar Documents

Drug culture / Health / Drug control law / Public health / Harm reduction / Substance abuse / Underground culture / Harm Reduction International / Drug policy reform / Drug policy / Needle exchange programme / Heroin

TOWARDS A SOCIOLOGY OF HARM REDUCTION: A COMPARATIVE STUDY OF DRUG POLICY CHANGE IN CANADA AND THE UNITED KINGDOM BETWEEN THE YEARS 1985 AND 2017 by

DocID: 1xVT2 - View Document

Mathematics / Algebra / Abstract algebra / Finite fields / Field theory / Angle / Sine / Factorial / XTR / Valuation / Non-analytic smooth function / Proof that  is irrational

IEEE TRANSACTIONS ON COMPUTERS, VOL. ??, NO. ??, ??? A New Range-Reduction Algorithm N. Brisebarre, D. Defour, P. Kornerup, J.-M Muller and N. Revol

DocID: 1xVRx - View Document

Language-level Symmetry Reduction for Probabilistic Model Checking Alastair F. Donaldson Alice Miller David Parker Computing Laboratory Department of Computing Science

DocID: 1xVun - View Document

Mathematical analysis / Mathematics / Symbol / Continuous function / Kazhdan's property / Limit of a function / Ergodic theory / Hopf decomposition / Ergodic flow

Approximate Partial Order Reduction? Chuchu Fan, Zhenqi Huang, and Sayan Mitra University of Illinois at Urbana-Champaign, ECE Department {cfan10, zhuang25, mitras}@illinois.edu Abstract. We present a new partial order

DocID: 1xVg7 - View Document

Algebra / Mathematics / Cryptography / Linear algebra / Lattice-based cryptography / Post-quantum cryptography / Lattice points / Computational hardness assumptions / Lattice / Euclidean vector / Basis / Crystal structure

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices Shi Bai1 , Damien Stehl´e1 and Weiqiang Wen1 1

DocID: 1xUq5 - View Document