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

Solving np-complete problems without hyper polynomial cost Download PDF

Info

Publication number
EP3123302A4
EP3123302A4 EP15768263.4A EP15768263A EP3123302A4 EP 3123302 A4 EP3123302 A4 EP 3123302A4 EP 15768263 A EP15768263 A EP 15768263A EP 3123302 A4 EP3123302 A4 EP 3123302A4
Authority
EP
European Patent Office
Prior art keywords
hyper
solving
complete problems
polynomial cost
polynomial
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
EP15768263.4A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP3123302A1 (en
Inventor
Clayton Gillespie
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
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 Individual filed Critical Individual
Publication of EP3123302A1 publication Critical patent/EP3123302A1/en
Publication of EP3123302A4 publication Critical patent/EP3123302A4/en
Pending legal-status Critical Current

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)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Computational Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • Algebra (AREA)
  • Databases & Information Systems (AREA)
  • Computing Systems (AREA)
  • Artificial Intelligence (AREA)
  • Computational Linguistics (AREA)
  • Operations Research (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Complex Calculations (AREA)
  • Computer Hardware Design (AREA)
  • Debugging And Monitoring (AREA)
  • Peptides Or Proteins (AREA)
  • Measuring Or Testing Involving Enzymes Or Micro-Organisms (AREA)
  • Stored Programmes (AREA)
  • Architecture (AREA)
  • Geometry (AREA)
  • Devices For Executing Special Programs (AREA)
EP15768263.4A 2014-03-25 2015-03-25 Solving np-complete problems without hyper polynomial cost Pending EP3123302A4 (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
EP3123302A1 EP3123302A1 (en) 2017-02-01
EP3123302A4 true EP3123302A4 (en) 2017-12-20

Family

ID=54196327

Family Applications (1)

Application Number Title Priority Date Filing Date
EP15768263.4A Pending EP3123302A4 (en) 2014-03-25 2015-03-25 Solving np-complete problems without hyper polynomial cost

Country Status (10)

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

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
WO2019017412A1 (ja) * 2017-07-19 2019-01-24 国立大学法人横浜国立大学 解探索装置およびプログラム
US10503507B2 (en) * 2017-08-31 2019-12-10 Nvidia Corporation Inline data inspection for workload simplification
CN111159631B (zh) * 2019-12-31 2023-08-11 中国人民解放军国防科技大学 一种基于可编程逻辑的硬件sat求解器
CN117172473A (zh) * 2023-09-04 2023-12-05 晞德求索(北京)科技有限公司 基于动态分配的一维下料方法和装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009097290A2 (en) * 2008-01-29 2009-08-06 Clayton Gillespie Data processing system for solving np problems without hyper-polynomial cost
US20110161266A1 (en) * 2008-01-29 2011-06-30 Clayton Gillespie System, method and device for solving problems in np without hyper-polynomial cost

Family Cites Families (11)

* 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
EP1877968A2 (en) * 2005-04-12 2008-01-16 Alianna J. Maren System and method for evidence accumulation and hypothesis generation
US8838659B2 (en) * 2007-10-04 2014-09-16 Amazon Technologies, Inc. Enhanced knowledge repository
CN101848229B (zh) * 2009-03-24 2014-06-25 北京理工大学 一种解决分布式网络计算中最小生成网络问题的方法
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 (ja) * 2010-06-12 2012-01-05 Koji Kobayashi 論理式変換プログラム、及びｓａｔ解法プログラム
CN102063643B (zh) * 2010-12-13 2014-07-30 北京航空航天大学 一种基于dna计算的智能优化仿真方法
US9141354B2 (en) * 2012-04-23 2015-09-22 Ecole polytechnique fédérale de Lausanne (EPFL) Advantageous state merging during symbolic analysis

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009097290A2 (en) * 2008-01-29 2009-08-06 Clayton Gillespie Data processing system for solving np problems without hyper-polynomial cost
US20110161266A1 (en) * 2008-01-29 2011-06-30 Clayton Gillespie System, method and device for solving problems in np without hyper-polynomial cost

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of WO2015148599A1 *

Also Published As

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

Similar Documents

Publication Publication Date Title
EP3161718A4 (en) Encryption architecture
EP3171299A4 (en) Multi-smartcard
EP3206710A4 (en) Incretin-insulin conjugates
EP3129108A4 (en) Hoverboard
EP3119885A4 (en) Antibody-fynomer conjugates
EP3204975A4 (en) Sofc-conduction
EP3176050A4 (en) Interlocking device
IL247866B (en) Solving np-complete problems without hyper-polynomial cost
EP3092163A4 (en) Stroller
EP3109484A4 (en) Air-blowing device
EP3228352A4 (en) Electro-stimulator
EP3176051A4 (en) Interlocking device
EP3135947A4 (en) Irreversible mechanism
EP3166949A4 (en) Thienothiophene-isoindigo
EP3109482A4 (en) Air-blowing device
EP3152248A4 (en) Dendrimer-drug conjugates
EP3238557A4 (en) Babygrow
EP3127418A4 (en) Improved fodder-dispensing device
EP3160401A4 (en) Alignment wrap
EP3199528A4 (en) Abscinazole
EP3110412A4 (en) 4-benzylsulfonyl-2-butenenitrile
AU2014905171A0 (en) GroundControl
AU2014904776A0 (en) Weldoze
AU2014904667A0 (en) Barrowmate
AU2014904529A0 (en) Gulicurl

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20160826

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20171121

RIC1 Information provided on ipc code assigned before grant

Ipc: G06F 17/50 20060101ALI20171115BHEP

Ipc: G06F 9/30 20060101ALI20171115BHEP

Ipc: G06F 17/11 20060101AFI20171115BHEP

Ipc: G06N 5/04 20060101ALI20171115BHEP

APBK Appeal reference recorded

Free format text: ORIGINAL CODE: EPIDOSNREFNE

APBN Date of receipt of notice of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA2E

APBR Date of receipt of statement of grounds of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA3E

APAF Appeal reference modified

Free format text: ORIGINAL CODE: EPIDOSCREFNE