IL247866A0 - Solving np-complete problems without hyper polynomial cost - Google Patents

Solving np-complete problems without hyper polynomial cost

Info

Publication number
IL247866A0
IL247866A0 IL247866A IL24786616A IL247866A0 IL 247866 A0 IL247866 A0 IL 247866A0 IL 247866 A IL247866 A IL 247866A IL 24786616 A IL24786616 A IL 24786616A IL 247866 A0 IL247866 A0 IL 247866A0
Authority
IL
Israel
Prior art keywords
hyper
solving
complete problems
polynomial cost
polynomial
Prior art date
Application number
IL247866A
Other languages
Hebrew (he)
Other versions
IL247866B (en
Inventor
gillespie Clayton
Original Assignee
gillespie Clayton
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by gillespie Clayton filed Critical gillespie Clayton
Publication of IL247866A0 publication Critical patent/IL247866A0/en
Publication of IL247866B publication Critical patent/IL247866B/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/04—Inference or reasoning models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00—Details relating to CAD techniques
    • G06F2111/06—Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/30—Circuit design
    • G06F30/39—Circuit design at the physical level
    • G06F30/392—Floor-planning or layout, e.g. partitioning or placement

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Mathematical Analysis (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • Computational Linguistics (AREA)
  • Algebra (AREA)
  • Artificial Intelligence (AREA)
  • Databases & Information Systems (AREA)
  • Computing Systems (AREA)
  • Operations Research (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Complex Calculations (AREA)
  • Computer Hardware Design (AREA)
  • Stored Programmes (AREA)
  • Debugging And Monitoring (AREA)
  • Peptides Or Proteins (AREA)
  • Measuring Or Testing Involving Enzymes Or Micro-Organisms (AREA)
  • Architecture (AREA)
  • Geometry (AREA)
  • Devices For Executing Special Programs (AREA)
IL247866A 2014-03-25 2016-09-18 Solving np-complete problems without hyper polynomial cost IL247866B (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201461970291P 2014-03-25 2014-03-25
PCT/US2015/022377 WO2015148599A1 (en) 2014-03-25 2015-03-25 Solving np-complete problems without hyper polynomial cost

Publications (2)

Publication Number Publication Date
IL247866A0 true IL247866A0 (en) 2016-11-30
IL247866B IL247866B (en) 2021-05-31

Family

ID=54196327

Family Applications (1)

Application Number Title Priority Date Filing Date
IL247866A IL247866B (en) 2014-03-25 2016-09-18 Solving np-complete problems without hyper polynomial cost

Country Status (10)

Country Link
EP (1) EP3123302A4 (en)
JP (1) JP6550384B2 (en)
KR (1) KR102341689B1 (en)
CN (1) CN105745618A (en)
AU (1) AU2015236144B2 (en)
CA (1) CA2943044C (en)
IL (1) IL247866B (en)
MY (1) MY184777A (en)
SG (1) SG11201606976PA (en)
WO (1) WO2015148599A1 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10528868B2 (en) 2010-06-25 2020-01-07 Clayton Gillespie Solving NP-complete problems without hyper polynomial cost
US10948887B2 (en) 2016-11-10 2021-03-16 Precisionlife Ltd Control apparatus and method for processing data inputs in computing devices therefore
US11881287B2 (en) 2016-11-10 2024-01-23 Precisionlife Ltd Control apparatus and method for processing data inputs in computing devices therefore
JP7044397B2 (en) * 2017-07-19 2022-03-30 国立大学法人横浜国立大学 Solution search device and program
US10503507B2 (en) * 2017-08-31 2019-12-10 Nvidia Corporation Inline data inspection for workload simplification
CN111159631B (en) * 2019-12-31 2023-08-11 中国人民解放军国防科技大学 Hardware SAT solver based on programmable logic
CN117172473A (en) * 2023-09-04 2023-12-05 晞德求索(北京)科技有限公司 One-dimensional blanking method and device based on dynamic allocation

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6038392A (en) * 1998-05-27 2000-03-14 Nec Usa, Inc. Implementation of boolean satisfiability with non-chronological backtracking in reconfigurable hardware
US7356519B1 (en) * 2003-02-28 2008-04-08 Cadence Design Systems, Inc. Method and system for solving satisfiability problems
WO2006110853A2 (en) * 2005-04-12 2006-10-19 Maren Alianna J System and method for evidence accumulation and hypothesis generation
US8838659B2 (en) * 2007-10-04 2014-09-16 Amazon Technologies, Inc. Enhanced knowledge repository
WO2009097290A2 (en) * 2008-01-29 2009-08-06 Clayton Gillespie Data processing system for solving np problems without hyper-polynomial cost
US8577825B2 (en) * 2008-01-29 2013-11-05 Clayton Gillespie System, method and device for solving problems in NP without hyper-polynomial cost
CN101848229B (en) * 2009-03-24 2014-06-25 北京理工大学 Method for solving minimum generated network problem in distributed network computing
US8813007B2 (en) * 2009-04-17 2014-08-19 Synopsys, Inc. Automatic approximation of assumptions for formal property verification
US8369841B2 (en) * 2010-02-16 2013-02-05 Thaddeus John Kobylarz Invoke facility service and its applications to compound wireless mobile communication services
US9110882B2 (en) * 2010-05-14 2015-08-18 Amazon Technologies, Inc. Extracting structured knowledge from unstructured text
JP2012003733A (en) * 2010-06-12 2012-01-05 Koji Kobayashi Logical formula conversion program and sat solution program
CN102063643B (en) * 2010-12-13 2014-07-30 北京航空航天大学 Intelligent optimized simulation method based on DNA computation
US9141354B2 (en) * 2012-04-23 2015-09-22 Ecole polytechnique fédérale de Lausanne (EPFL) Advantageous state merging during symbolic analysis

Also Published As

Publication number Publication date
SG11201606976PA (en) 2016-09-29
CA2943044A1 (en) 2015-10-01
EP3123302A4 (en) 2017-12-20
AU2015236144B2 (en) 2020-04-30
MY184777A (en) 2021-04-21
WO2015148599A1 (en) 2015-10-01
JP6550384B2 (en) 2019-07-24
EP3123302A1 (en) 2017-02-01
IL247866B (en) 2021-05-31
CA2943044C (en) 2023-05-16
KR20160136270A (en) 2016-11-29
CN105745618A (en) 2016-07-06
JP2017513076A (en) 2017-05-25
KR102341689B1 (en) 2021-12-20
AU2015236144A1 (en) 2016-11-03

Similar Documents

Publication Publication Date Title
IL304663A (en) Combination
ZA201704297B (en) Pyrrolobenzodiazepine-antibody conjugates
IL247073A0 (en) Combination
PT3119885T (en) Antibody-fynomer conjugates
LT3102748T (en) Grating
IL251091A0 (en) P2x7 modulating n-acyl-triazolopyrazines
IL251067A0 (en) P2x7 modulators
IL247866B (en) Solving np-complete problems without hyper polynomial cost
IL252511A0 (en) Light-injecting element
LT3237349T (en) Improved biobinder
HUE053256T2 (en) Sequence variants
GB201417948D0 (en) Enhanced documentation validation
GB201403515D0 (en) Thermometer
GB201402083D0 (en) Retaining means
HK1212747A1 (en) Spacing element
GB201411243D0 (en) Swatch
HK1222596A1 (en) Fixing
GB201501123D0 (en) Concept E
GB201403322D0 (en) ProStrike Concept
GB201408309D0 (en) Concept nine
GB201420910D0 (en) Pyrrolobenzodiazepine-antibody conjugates
GB201405832D0 (en) Improved fixing
GB201416509D0 (en) Project P
GB201411702D0 (en) Improved packs
GB201408997D0 (en) Buyers unite

Legal Events

Date Code Title Description
FF Patent granted